The subsequence composition of a string

Theoretical Computer Science

Volumn 410, Issue 43, 2009, Pages 4360-4371

  Apostolico, Alberto ^a,b   Cunial, Fabio ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b Georgia Institute of Technology   (United States)

Author keywords

Constrained subsequences; Core equivalence classes; Special subsequences; String complexity measures; Suffix graph

Indexed keywords

CONSTRAINED SUBSEQUENCES; CORE EQUIVALENCE CLASSES; SPECIAL SUBSEQUENCES; STRING COMPLEXITY MEASURES; SUFFIX GRAPH;

GRAPH THEORY; SET THEORY; TEXT PROCESSING;

EQUIVALENCE CLASSES;

EID: 69849104103     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.07.017     Document Type: Article

References (16)

1. Brooks Jr. F.P. Three great challenges for half-century-old computer science. J. ACM 50 1 (2003) 25-26
2. Kolmogorov A.N. Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2 1 (1968) 157-168 1029-0265
3. Lempel A., and Ziv J. On the complexity of finite sequences. IEEE Trans. Inform. Theory 22 (1976) 75-81
4. Li M., Chen X., Li X., Ma B., and Vitányi P.M.B. The similarity metric. IEEE Trans. Inform. Theory 50 12 (2004) 3250-3264
5. Li W. The complexity of DNA. Complexity 3 2 (1997)
6. Qi J., Wang B., and Hao B. Whole proteome prokaryote phylogeny without sequence alignment: A k-string composition approach. Mol. Evol. 58 1 (2004) 1-11
7. Ulitsky I., Burstein D., Tuller T., and Chor B. The average common substring approach to phylogenetic reconstruction. J. Comput. Biol. 13 2 (2006) 336-350
8. Mannila H., Toivonen H., and Verkamo A.I. Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov. 1 3 (1997) 259-289
9. Colosimo A., and De Luca A. Special factors in biological strings. J. Theoret. Biol. 204 (2000) 29-46
10. Blumer A., Blumer J., Ehrenfeucht A., Haussler D., and McConnell R. Complete inverted files for efficient text retrieval and analysis. J. ACM 34 3 (1987) 578-595
11. Grätzer G. General Lattice Theory. second edition (1998), Birkhäuser Verlag
12. Chattaraj A., and Parida L. Varun: An inexact-suffix tree based algorithm for detecting extensible patterns. Theoret. Comput. Sci. 335 3-14 (2005)
13. Apostolico A., and Ehrenfeucht A. Efficient detection of quasiperiodicities in strings. Theoret. Comput. Sci. 119 2 (1993) 247-265
14. Lifson S., and Sander C. Antiparallel and parallel β-strands differ in amino acid residue preferences. Nature 282 (1979) 109-111
15. Alberto Apostolico, Matteo Comin, Laxmi Parida, Conservative extraction of overrepresented extensible motifs, in: Proceedings of ISMB 05, Intelligent Systems for Molecular Biology, Detroit, MI, 2005, pp. 9-18
16. Craig G. Nevill-Manning, Ian H. Witten, Protein is incompressible, in: Proceedings of the IEEE Data Compression Conference, 1999, pp. 257-266