Fast structured motif search in DNA sequences

Communications in Computer and Information Science

Volumn 13, Issue , 2008, Pages 58-73

  Halachev, Mihail ^a   Shiri, Nematollaah ^a  

^a Civil and Environmental Engineering   (Canada)

Author keywords

DNA sequences; Performance; Structured motif; Suffix tree

Indexed keywords

BIOINFORMATICS; BIRDS; DNA; FORESTRY; TREES (MATHEMATICS);

MOTIF SEARCH; PERFORMANCE; SEARCH TIME; STRUCTURED MOTIF; SUFFIX-TREES;

DNA SEQUENCES;

EID: 84885778357     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-70600-7_5     Document Type: Article

References (17)

1. Zhang, Y., Zaki, M.J.: SMOTIF: efficient structured pattern and profile motif search. Algorithms for Molecular Biology, 1-22 (November 2006)
2. McCarthy, E., McDonald, J.: LTR_STRUC: A Novel Search and Identification Program for LTR Retrotransposons. Bioinformatics 19(3), 362-367 (2003)
3. Feschotte, C., Jiang, N., Wessler, S.: Plant transposable elements: where genetics meets genomics. Nature Review Genetics 3(5), 329-341 (2002)
4. Jurka, J., Kapitonov, V., Pavlicek, A., Klonowski, P., Kohany, O., Walichiewicz, J.: Repbase Update, a database of eukaryotic repetitive elements. Cytogenet Genome Res 110(1-4), 462-467 (2005)
5. Policriti, A., Vitacolonna, N., Morgante, M., Zuccolo, A.: Structured Motif Search. In: Int'l Conf. on Research in Computational Molecular Biology, pp. 133-139 (2004)
6. Mehldau, G., Myers, G.: A system for Pattern Matching Applications on Biosequences. Computer Applications in the Biosciences 9(3), 299-314 (1993)
7. Myers, E.: Approximate Matching of Network Expressions with Spacers. J. Comput. Biol. 3(1), 33-51 (1996)
8. Navarro, G., Raffinot, M.: Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Application to protein Searching. J. Comput. Biol. 10(6), 903-923 (2003)
9. Zaki, M.J.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning Journal 42(1/2), 1-31 (2001)
10. Zaki, M.J.: Sequence Mining in Categorical Domains: Incorporating Constraints. In: ACM Int'l Conf on Information and Knowledge Management, pp. 422-429 (2000)
11. Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)
12. Halachev, M., Shiri, N., Thamildurai, A.: Efficient and scalable indexing techniques for biological sequence data. In: Hochreiter, S., Wagner, R. (eds.) BIRD 2007. LNCS (LNBI), vol. 4414, pp. 464-479. Springer, Heidelberg (2007)
13. FASST web-interface, http://sepehr.cs.concordia.ca/
14. Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix trees. Software-Practice and Experience 33(11), 1035-1049 (2003)
15. Tian, Y., Tata, S., Hankins, R.A., Patel, J.: Practical methods for constructing suffix trees. VLDB Journal 14(3), 281-299 (2005)
16. Human Genome Data, ftp://ftp.ncbi.nih.gov/genomes/H_sapiens/Assembled_chromosomes
17. SMOTIF1 source code, http://www.cs.rpi.edu/~zaki/software/sMotif/