The SCP and compressed domain analysis of biological sequences

Proceedings of the 2003 IEEE Bioinformatics Conference, CSB 2003

Volumn , Issue , 2003, Pages 587-592

  Adjeroh, D ^a   Feng, J ^a  

^a West Virginia University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANCHOR POINT; BIOLOGICAL SEQUENCES; COMPRESSED DOMAIN; COMPRESSION SCHEME; INTERNAL REPRESENTATION; MULTIPLE SEQUENCE ALIGNMENTS;

BIOINFORMATICS;

EID: 84960376493     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSB.2003.1227416     Document Type: Conference Paper

References (15)

1. Adjeroh D.A., Zhang Y, Mukherjee A., Zhang N., Powell M., and Bell, T.C., "DNA sequence compression using the Burrows-Wheeler Transform", Proc., IEEE Bioinformatics Conference, August 2003, pp. 303-313, 2002
2. Apostolico A and Lonardi S, "Offline compression by greedy textual substitution", Proceedings of the IEEE, 88(11), 1733-1744, 2000
3. Bat O, Kimmel M., and Axelrod D. E, "Computer simulation of expansions of DNA triplet repeats in the Fragile X Syndrome and Huntington's disease", J. Theoretical Biology, 188, 53-67,. 1997
4. M. Burrows and D.J. Wheeler, "A block-sorting lossless data compression algorithm", Technical Report, Digital Equipment Corp., Palo Alto, CA, 1994.
5. Chen X., Kwong S.and Li M, "A compression algorithm for DNA sequences and its applications in genome comparison", In Proceedings, 10th Workshop on Genome Informatics (GIW'99), pp. 52-61, 1999.
6. DasGupta B, and Wang L., "Selected topics in computational biology", Department of Computer Science, Rutgers University, Camden, NJ, 1998
7. Durbin, R., Eddy, S., Krogh, A., & Mitchison, G, Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, Cambridge University Press, (1998).
8. Grumbach S and Tahi F., "A new challenge for compression algorithms: genetic sequences", Info. Processing & Management, 30: 875-886, 1994.
9. D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, UK, 1997.
10. S. Karlin, G. Ghandour, F. Ost, S. Tavare and L.J. Korn, "New approaches for computer analysis of nucleic acid sequences", Proc., National Academy of Sciences USA, 80, pp. 5660-5664, Sept. 1983.
11. Lanctot J. K., Li M. and Yang E., "Estimating DNA sequence entropy", Proceedings, 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2000), pp. 409-418, 2000.
12. Loewenstem, D. and Yainilos, P., "Significantly lower entropy estimates for natural DNA sequences", Proc., IEEE Data Compression Conference, Snowbird, UT, pp. 151-161, 1997.
13. U. Manber and G. Myers, "Suffix arrays: A new method for on-line string searches", SIAM Journal of Computing, 22(5), 935-948, 1993.
14. E. M. McCreight, "A space-economical suffix tree construction algorithm", J. ACM, 23(2), 262-272, 1976.
15. H. Yokoo, "Data compression using a sort-based context similarity measure", The Computer J., 40(2/3), 94-102, 1997.