Mining, compressing and classifying with extensible motifs

Algorithms for Molecular Biology

Volumn 1, Issue 1, 2006, Pages

  Apostolico, Alberto ^a,b   Comin, Matteo ^a   Parida, Laxmi ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b Georgia Institute of Technology   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34248385154     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/1748-7188-1-4     Document Type: Article

References (14)

1. Chattaraj A Parida L An inexact suffix tree based algorithm for extensible pattern discovery Theoretical Computer Science 2005 335 3-14 10.1016/j.tcs.2004.12.013
2. Vinga S Almeida J Alignment-free sequence comparison - a review Bioinformatics 2003 19 4 513-523 10.1093/bioinformatics/btg005 12611807
3. Li M Vitanyi P An Introduction to Kolmogorov Complexity and Its Applications Springer Verlag 1997
4. Lempel A Ziv J On the Complexity of Finite Sequences IEEE Transactions on Information Theory 1976 22 75-81 10.1109/TIT.1976.1055501
5. Apostolico A Comin M Parida L Motifs in Ziv-Lempel-Welch Clef Proceedings of IEEE DCC Data Compression Conference 2004 72-81
6. Nevill-Manning C Witten I Protein is Incompressible Proceedings of IEEE DCC Data Compression Conference 1999 257-266
7. Li M Chen X Li X Ma B Vitanyi P The Similarity Metric IEEE Transactions on Information Theory 2004 50 12 3250-3254 10.1109/TIT.2004.838101
8. Li M Badger J Chen X Kwong S Kearney P Zhang H An Information-based Sequence Distance and its Application to whole Mitochondrial Genome Phylogeny Bioinformatics 2001 17 2 149-154 10.1093/bioinformatics/ 17.2.149 11238070
9. Storer JA Data Compression: Methods and Theory Computer Science Press 1988
10. Apostolico A Lonardi S Off-line Compression by Greedy Textual Substitution Proceedings of the IEEE 2000 88 11 1733-1744 10.1109/ 5.892709
11. Kieffer J Yang E Grammar-based Codes: A New Class of Universal Lossless Source Codes IEEE Transactions on Information Theory 2000 46 737-754 10.1109/18.841160
12. Neville-Manning C Witten IH Maulsby D Compression by Induction of Hierarchical Grammars Proceedings of IEEE DCC Data Compression Conference 1994 244-253
13. DeAgostino S Storer JA On-line Versus Off-line Computation in Dynamic Text Compression Inform Process Lett 1996 59 3 169-174 10.1016/ 0020-0190(96)00068-3
14. Lehman E Shelat A Approximation Algorithms for Grammar Based Compression Proceedings of the eleventh ACM-SIAM Symposium on Discrete Algorithms (SODA) 2002 205-212