Extracting common motifs under the levenshtein measure: Theory and experimentation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2452, Issue , 2002, Pages 140-156

  Adebiyi, Ezekiel F ^a   Kaufmann, Michael ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS;

EDIT DISTANCE; TANDEM REPEATS;

HAMMING DISTANCE;

EID: 84957000434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45784-4_11     Document Type: Conference Paper

References (20)

1. E. F. Adebiyi, T. Jiang, and M. Kaufmann. An efficient algorithm for finding short approximate non-tandem repeats (Extended Abstract). Bioinformatics, 17(1):S5-S13, 2001.
2. E. F. Adebiyi. Pattern Discovery in Biology and Strings Sorting: Theory and Experimentation. Ph. D Thesis, 2002.
3. A. Blumer and A. Ehrenfeucht and others. Average size of suffix trees and DAWGS. Discrete Applied Mathematics, 24, 37-45, 1989.
4. J.-M. Claverie and S. Audic. The Statistical significance of nucleotide positionweight matrix matches. Computer Applications in Biosciences 12(5), 431-439, 1996.
5. M. Crochemore and M.-F. Sagot. Motifs in sequences: localization and extraction. In Handbook of Computational Chemistry, Crabbe, Drew, Konopka, eds., Marcel Dekker, Inc., 2001. To appear.
6. D. Gusfield. Algorithms on strings, trees and sequences. Cambridge University Press, New York, 1997.
7. J. D. Helmann. Compilation and analysis of Bacillus Subtilis σA-dependent promoter sequences: evidence for extended contact between RNA polymerase and upstream promoter DNA., Nucleic Acids Research, 23(13): 2351-2360, 1995.
8. L. C. K. Hui. Color set size problem with applications to string matching. In CPM Proceeding, vol. 644 of LNCS, 230-243, 1992.
9. S. Karlin, F. Ost, and B. E. Blaisdell. Patterns in DNA and amino acid sequences and their statistical significance. In M. S. Waterman, editor, Mathematical Methods for DNA Sequences, 133-158, 1989.
10. C. J. McInerny, J. F. Patridge, G. E. Mikesell, D. P. Creemer, and L. L. Breeden. A novel Mcm1-dependent element in the SWI4, CLN3, CDC6, CDC46, and CDC47 promoters activates M/G1-specific transcription. Genes and Development, 11: 1277-1288, 1997.
11. E. Myers. A sub-linear algorithm for approximate keyword matching. Algorithmica 12, 4-5, 345-374, 1994.
12. L. Marsan and M. F. Sagot. Extracting structured motifs using a suffix treealgorithms and application to promoter consensus identification. RECOMB 2000.
13. P. Pevzner and S.-H. Sze. Combinatorial approaches to finding subtle signals in DNA sequences. ISMB, 269-278, 2000.
14. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes. In The Art of Scientific Computing, Cambridge University Press, Cambridge.
15. E. Rocke and M. Tompa. An algorithm for finding novel gaped motifs in DNA sequences. RECOMB, 228-233, 1998.
16. B. Schieber and U. Vishkin. On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM Journal on Computing, 17:1253-1262, 1988.
17. M.-F. Sagot. Spelling approximate repeated or common motifs using a suffix tree. LNCS 1380: 111-127, 1998.
18. J. F. Tomb et al. The complete genome sequence of the gastric pathogen Helicobacter pylori. Nature, 388, 539-547, 1997.
19. E. Ukkonen. Approximate string matching over suffix trees. LNCS 684: 228-242, 1993.
20. A. Vanet, L. Marsan, A. Labigne and M.-F. Sagot. Inferring regulatory elements from a whole genome. an analysis of Helicobacter pylori σ80 family of promoter signals. J. Mol. Biol., 297, 335-353, 2000.