๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

String Matching in the DNA Alphabet

โœ Scribed by JORMA TARHIO; HANNU PELTOLA

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
89 KB
Volume
27
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

โœฆ Synopsis

Searching for long DNA strings is studied. A q-gram variation of the Boyer-Moore algorithm is considered. An alphabet transformation with precomputed tables is utilized to reduce the processing time. Experimental results show that the new algorithm is efficient in practice.

๐Ÿ“œ SIMILAR VOLUMES

String-matching on ordered alphabets
String-matching on ordered alphabets
โœ Maxime Crochemore ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 975 KB
Alphabet dependence in parameterized mat
Alphabet dependence in parameterized matching
โœ Amihood Amir; Martin Farach; S. Muthukrishnan ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 746 KB
Fastest Pattern Matching in Strings
Fastest Pattern Matching in Strings
โœ L. Colussi ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 850 KB

An algorithm is presented that substantially improves the algorithm of Boyer and Moore for pattern matching in strings, both in the worst case and in the average. Both the Boyer and Moore algorithm and the new algorithm assume that the characters in the pattern and in the text are taken from a given

Experiments on string matching in memory
Experiments on string matching in memory structures
โœ Thierry Lecroq ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 59 KB ๐Ÿ‘ 1 views

Various string matching algorithms have been designed and some experimental work on string matching over bounded alphabets has been performed, but string matching over unbounded alphabets has been little investigated. We present here experimental results where symbols are taken among potentially inf