Efficient computation of shortest absent words in a genomic sequence

Information Processing Letters

Volumn 110, Issue 14-15, 2010, Pages 596-601

  Wu, Zong Da ^a   Jiang, Tao ^b   Su, Wu Jie ^c  

^a WENZHOU UNIVERSITY   (China)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c JIANGSU UNIVERSITY   (China)

Author keywords

Absent words; Algorithms; Sequence analysis; Shortest absent words

Indexed keywords

ALGORITHMS; GENES; TREES (MATHEMATICS);

ABSENT WORDS; EFFICIENT COMPUTATION; GENOMIC RESEARCH; LINEAR-TIME ALGORITHMS; PROBABILISTIC METHODS; SEQUENCE ANALYSIS; SHORTEST ABSENT WORDS; SPACE REQUIREMENTS;

COMPUTATIONAL EFFICIENCY;

EID: 79961174674     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.05.008     Document Type: Article

References (8)

1. B. Haubold, N. Pierstorff, F. Möller, T. Wiehe, Genome comparison without alignment using shortest unique substrings, BMC Bioinformatics 6 (2005) 123.
2. G. Hampikian, T. Andersen, Absent sequences: Nullomers and primes, in: Pacific Symposium on Biocomputing, vol. 12, 2007, pp. 355-366.
3. C. Acquisti, G. Poste, D. Curtiss, S. Kumar, Nullomers: Really a matter of natural selection, PLoS ONE 2 (2007) 10.
4. J. Herold, S. Kurtz, R. Giegerich, Efficient computation of absent words in genomic sequences, BMC Bioinformatics 9 (2008) 167.
5. A. Pinho, P. Ferreira, S. Garcia, J. Rodrigues, On finding minimal absent words, BMC Bioinformatics 10 (2009) 137.
6. E.M. McCreight, A space-economical suffix tree construction algorithm, Journal of the ACM 23 (2) (1976) 262-272.
7. U. Manber, G. Myers. Suffix arrays: A new method for on-line string searches, in: Proc. of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 319-327.
8. S. Rahmann, E. Rivals, On the distribution of the number of missing words in random texts, Combinatorics, Probability and Computing 12 (2003) 73-87.