Efficient detection of unusual words

Journal of Computational Biology

Volumn 7, Issue 1-2, 2000, Pages 71-94

  Apostolico, Alberto ^a,b   Bock, Mary Ellen ^c   Lonardi, Stefano ^a   Xu, Xuyan ^a  

^a Purdue University   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

^c PURDUE UNIVERSITY   (United States)

Author keywords

Annotated suffix tree; Combinatorics on strings; Design and analysis of algorithms; DNA sequence; Over and underrepresented word; Pattern matching; Period of a string; Substring statistics; Suffix tree; Word count

Indexed keywords

ALGORITHM; DNA SEQUENCE; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROBABILITY; REVIEW; STATISTICAL ANALYSIS; STATISTICAL MODEL; VARIANCE; WORD RECOGNITION;

ALGORITHMS; BASE SEQUENCE; BIOMETRY; DNA, FUNGAL; DNA, VIRAL; GENOME, VIRAL; HERPESVIRUS 1, HUMAN; MODELS, STATISTICAL; PATTERN RECOGNITION, AUTOMATED; SACCHAROMYCES CEREVISIAE; SEQUENCE ANALYSIS, DNA;

EID: 0034100094     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/10665270050081397     Document Type: Review

References (21)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. 1974. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass.
2. Aho, A.V. 1990. Algorithms for finding patterns in strings, in Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity, (J. van Leeuwen, ed.), Elsevier, 255-300.
3. Apostolico, A. 1985. The myriad virtues of suffix trees, Combinatorial Algorithms on Words, (A. Apostolico and Z. Galil, eds.), Springer-Verlag Nato ASI Series F, Vol. 12, 85-96.
4. Apostolico, A., Bock, M.E., and Xuyan, X. 1998. Annotated statistical indices for sequence analysis, (invited paper) Proceedings of Compression and Complexity of SEQUENCES 97, IEEE Computer Society Press, 215-229.
5. Apostolico, A., and Galil, Z. (eds.) 1997. Pattern Matching Algorithms, Oxford University Press.
6. Apostolico, A., and Preparata, F.P. 1996. Data structures and algorithms for the string statistics problem, Algorithmica, 15, 481-494.
7. Apostolico, A., and Szpankowski, W. 1992. Self-alignments in words and their applications, Journal of Algorithms, 13, 446-467.
8. Brendel, V., Beckman, J.S., and Trifonov, E.N. 1986. Linguistics of nucleotide sequences: morphology and comparison of vocabularies, Journal of Biomolecular Structure and Dynamics, 4, 1, 11-21.
9. Chen, M.T., and Seiferas, J. 1985. Efficient and elegant subword tree construction, 97-107. In Apostolico, A., and Galil, Z., eds., Combinatorial Algorithm on Words. Series F, Vol. 12, Springer-Verlag, Berlin, NATO Advanced Science Institutes.
10. Crochemore, M., and Rytter, W. 1994. Text Algorithms, Oxford University Press, New York.
11. Frohlich, M., and Werner, M. 1995. Demonstration of the interactive graph visualization system Davinci, In Proceedings of DIMACS Workshop on Graph Drawing '94, Princeton (USA) 1994, LNCS No. 894, R. Tamassia and I. Tollis, Eds., Springer Verlag.
12. Gansner, E.R., Koutsofios, E., North, S., and Vo, K.-P. 1993. A technique for drawing directed graphs. IEEE Trans. Software Eng. 19, 3, 214-230.
13. van Helden, J., Andrè, B., and Collado-Vides, J. 1998. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J. Mol. Biol., 281, 827-842.
14. Leung, M.Y., Marsh, G.M., and Speed, T.P. 1996. Over-and underrepresentation of short DNA words in herpesvirus genomes, Journal of Computational Biology 3, 3, 345-360.
15. Lothaire, M. 1982. Combinatorics on Words, Addison Wesley, Reading, Mass.
16. P in a free group, Mich. Math. Journal 9, 289-298.
17. McCreight, E.M. 1976. A space economical suffix tree construction algorithm, Journal of the ACM, 25, 262-272.
18. Musser, D.R., and Stepanov, A.A. 1984. Algorithm-oriented generic libraries, Software - Practice and Experience 24, 7, 623-642.
19. Schbath, S. 1997. An Efficient Statistic to Detect Over- and Under-represented words, J. Comp. Biol. 4, 2, 189-192.
20. Waterman, M.S. 1995. Introduction to Computational Biology, Chapman and Hall.
21. Weiner, P. 1973. Linear pattern matching algorithm, 1-11. In Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory. IEEE Computer Society Press, Washington, D.C.