Using suffix trees for gapped motif discovery_

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

Volumn 1848, Issue , 2000, Pages 335-349

  Rocke, Emily ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA SEQUENCES; PATTERN MATCHING;

BEST MATCH; GIBBS SAMPLERS; GIBBS SAMPLING; GIBBS SAMPLING METHODS; LOCAL SEARCH METHOD; PROTEIN SEQUENCES; SUFFIX-TREES; TEXT STRING;

FORESTRY;

SAMPLING; TREES;

EID: 0013025269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45123-4_28     Document Type: Conference Paper

References (14)

1. Chang, W.I., Lampe, J., Theoretical and Empirical Comparisons of Approximate String Matching Algorithms. Proc. 3rd Symp. on Combinatorial Pattern Matching, Springer LNCS 644, 175-84, 1992
2. Fickett, J.W., Fast Optimal Alignment. Nucl. Acids Res., 12:175-80, 1984
3. Gusfield, D., Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York, 1997
4. Landau, G.M., Vishkin, U., Efficient string matching with k mismatches. Theor. Comp. Sci., 43:239-49, 1986
5. Lawrence, C., Altschul, S., Boguski, M., Liu, J., Neuwald, A., Wootton, J. Detecting Subtle Sequence Signals: A Gibbs Sampling Strategy for Multiple Alignment. Science, 262:208-214, 8 October 1993
6. Marsan, L., Sagot, M.F., Extracting Structured Motifs Using a Suffix Tree— Algorithms and Application to Promoter Consensus Identification. To appear in Proceedings of RECOMB 2000
7. Meyers, E.W., An O(nd) Difference Algorithm and Its Variations. Algorithmica, 1:251-66, 1986
8. Rocke, E., Tompa, M., An Algorithm for Finding Novel Gapped Motifs in DNA Sequences. Proceedings of the Second Annual International Conference on Computational Molecular Biology, 228-233., New York, NY, March 1998
9. Sagot, M-F., Spelling Approximate Repeated or Common Motifs Using a Suffix Tree. Proceedings of LATIN, 374-390, 1998
10. Smith, T.F., Waterman, M.S., Identification of Common Molecular Subsequences. J. Mol. Biol., 284:1-18, 1995
11. Ukkonen, E., Approximate String-Matching Over Suffix Trees. Proc. 4th Symp. on Combinatorial Pattern Matching, Springer LCNS 684, 228-42, 1993
12. Ukkonen, E., On-line Construction of Suffix-Trees. Algorithmica, 14:249-60, 1995
13. Ukkonen, E., Algorithms for Approximate String Matching. Information Control, 64:100-18, 1985
14. Weiner, P., Linear Pattern Matching Algorithms. Proc. of the 14th IEEE Symp. on Switching and Automata Theory, 1-11, 1973