Fast and adaptive variable order Markov chain construction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5251 LNBI, Issue , 2008, Pages 306-317

  Schulz, Marcel H ^a,c   Weese, David ^b   Rausch, Tobias ^b,c   Döring, Andreas ^b   Reinert, Knut ^b   Vingron, Martin ^a  

^a MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c INTERNATIONAL MAX PLANCK RESEARCH SCHOOL FOR COMPUTATIONAL BIOLOGY AND SCIENTIFIC COMPUTING   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DEFORMATION; PARALLEL PROCESSING SYSTEMS; TECHNICAL PRESENTATIONS; TREES (MATHEMATICS);

COMPUTATIONAL BIOLOGIES; CONSTRUCTION ALGORITHMS; LINEAR TIMES; MARKOV CHAINS; ORDERS OF MAGNITUDES; PROTEIN FAMILIES; RUNNING TIMES; SEQUENCE ANALYSIS; SUFFIX ARRAYS; SUFFIX TREES; VARIABLE ORDERS;

MARKOV PROCESSES;

EID: 56649105047     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87361-7_26     Document Type: Conference Paper

References (27)

1. Rissanen, J.: A universal data compression system. IEEE Transactions on Information Theory 29, 656-664 (1983)
2. Ron, D., Singer, Y., Tishby, N.: The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning 25, 117-149 (1996)
3. Ben-Gal, I., Shani, A., Gohr, A., Grau, J., Arviv, S., Shmilovici, A., Posch, S., Grosse, L: Identification of transcription factor binding sites with variable-order Bayesian networks. Bioinformatics 21(11), 2657-2666 (2005)
4. Zhao, X., Huang, H., Speed, T.P.: Finding short DNA motifs using permuted Markov models. J. Comput. Biol. 12(6), 894-906 (2005)
5. Ogul, H., Mumcuoglu, E.U.: SVM-based detection of distant protein structural relationships using pairwise probabilistic suffix trees. Comput. Biol. Chem. 30(4), 292-299 (2006)
6. Dalevi, D., Dubhashi, D., Hermansson, M.: Bayesian classifiers for detecting HGT using fixed and variable order markov models of genomic signatures. Bioinformatics 22(5), 517-522 (2006)
7. Bejerano, G., Seldin, Y., Margalit, H., Tishby, N.: Markovian domain fingerprinting: statistical segmentation of protein sequences. Bioinformatics 17(10), 927-934 (2001)
8. Slonim, N., Bejerano, G., Fine, S., Tishby, N.: Discriminative feature selection via multiclass variable memory Markov model. EURASIP J. Appl. Signal Process 2003(1), 93-102 (2003)
9. Bejerano, G., Yona, G.: Variations on probabilistic suffix trees: statistical modeling and prediction of protein families. Bioinformatics 17(1), 23-43 (2001)
10. Posch, S., Grau, J., Gohr, A., Ben-Gal, L, Kel, A.E., Grosse, L: Recognition of cis-regulatory elements with vombat. J. Bioinform. Comput. Biol. 5(2B), 561-577 (2007)
11. Apostolico, A., Bejerano, G.: Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. J. Comput. Biol. 7(3-4), 381-393 (2000)
12. Bejerano, G.: Algorithms for variable length Markov chain modeling. Bioinformatics 20(5), 788-789 (2004)
13. Leonardi, F.G.: A generalization of the PST algorithm: modeling the sparse nature of protein sequences. Bioinformatics 22(11), 1302-1307 (2006)
14. Kurtz, S.: Reducing the space requirement of suffix trees. Software Pract. Exper. 29(13), 1149-1171 (1999)
15. Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix trees. Software Pract. Exper. 33(11), 1035-1049 (2003)
16. Manber, U., Myers, E.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935-948 (1993)
17. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2), 20 (2007)
18. Abouelhoda, M., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2, 53-86 (2004)
19. Bühlmann, P., Wyner, A.J.: Variable length Markov chains. Ann. Statist. 27(2), 480-513 (1999)
20. Maaß, M.G.: Computing suffix links for suffix trees and arrays. inf. Process. Lett. 101(6), 250-254 (2007)
21. Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica 40(1), 33-50 (2004)
22. Giegerich, R., Kurtz, S.: A comparison of imperative and purely functional suffix tree constructions. Sci. Comput. Program. 25, 187-218 (1995)
23. Benson, D.A., Karsch-Mizrachi, I., Lipman, D.J., Ostell, J., Wheeler, D.L.: Gen-Bank. Nucleic Acids Res. 36(Database issue), D25-D30 (2008)
24. Fitzgerald, P.C., Sturgill, D., Shyakhtenko, A., Oliver, B., Vinson, C.: Comparative genomics of drosophila and human core promoters. Genome Biol. 7, R53 (2006)
25. The UniProt Consortium: The Universal Protein Resource (UniProt). Nucl. Acids Res. 36(suppl.l), D190-195 (2008)
26. Döling, A., Weese, D., Rausch, T., Reinert, K.: SeqAn an efficient, generic C++ library for sequence analysis. BMC Bioinformatics 9, 11 (2008)
27. Schulz, M.H., Bauer, S., Robinson, P.N.: The generalised k-Truncated Suffix Tree for time- and space- efficient searches in multiple DNA or protein sequences, int. J. Bioinform. Res. Appl. 4(1), 81-95 (2008)