Sequence homology search based on database indexing using the Profile Hidden Markov Model

Proceedings - Sixth IEEE Symposium on BioInformatics and BioEngineering, BIBE 2006

Volumn , Issue , 2006, Pages 135-140

  Xue, Qiang ^a   Cole, James ^b   Pramanik, Sakti ^a  

^a Michigan State University   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DYNAMIC PROGRAMMING; HIDDEN MARKOV MODELS; INDEXING (MATERIALS WORKING); TREES (MATHEMATICS);

DATABASE INDEXING; PROTEIN SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY SEARCH;

PROTEINS;

EID: 34547401427     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2006.253326     Document Type: Conference Paper

References (15)

1. "Hmmer: profi le hmms for protein sequence analysis," October 27, 2005, http://hmmer.wustl.edu/.
2. M. Gribskov, A. D. McLachlan, and D. Eisenberg, "Profile analysis: Detection of distantly related proteins," vol. 84, 1987, pp. 4355-4358.
3. A. Krogh, M. Brown, I. S. Mian, K. Sjolander, and D. Haussler, "Hidden markov models in computational biology: Applications to protein modeling," Journal of Molecular Biology, vol. 235, no. 1501-1531, 1994.
4. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison, Biological sequence analysis: Probabilistic models of proteins and nucleic acids. Cambridge University Press, 1998.
5. D. Comer, 'Ubiquitous b-tree,"ACM Comput. Surv., vol. 11, no. 2, pp. 121-137, 1979.
6. Q. Xue, 'The hybrid digital tree and its application to genomic sequence databases," Ph.D. dissertation, Michigan State University, East Lansing, USA, 2005.
7. E. Ukkonen, "Approximate string-matching over suffi x trees," in Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching. Springer-Verlag, 1993, pp. 228-242.
8. _, "On-line construction of suffi x-trees," Algorithmica, vol. 14, pp. 249-260, 1995.
9. D. Gusfl eld, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge: Cambridge University Press, 1997.
10. G. Navarro and R. Baeza-Yates, "A hybrid indexing method for approximate string matching," Journal of Discrete Algorithms (JDA), vol. 1, no. 1, pp. 205-239, 2000, special issue on Matching Patterns.
11. E. Hunt, M. P. Atkinson, and R. W. Irving, 'Database indexing for large dna and protein sequence collections," The VLDB Journal, vol. 11, no. 3, pp. 256-271, 2002.
12. S. R. Eddy, HMMER Userś Guide, October 2003, ftp://ftp.genetics.wustl.edu/pub/eddy/hmmer/CURRENT/Userguide.pdf.
13. A. Bateman, L. Coin, R. Durbin, R. D. Finn, V. Hollich, S. Griffi ths-Jones, A. Khanna, M. Marshall, S. Moxon, E. L. L. Sonnhammer, D. J. Studholme, C. Yeats, and S. R. Eddy, "The pfam protein families database,"Nucleic Acids Res., vol. 32, pp. D138-D141, 2004.
14. A. Bateman, E. Birney, L. Cerruti, R. Durbin, L. Etwiller, S. R. Eddy, S. Griffi ths-Jones, K. L. Howe, M. Marshall, and E. L. L. Sonnhammer, 'The pfam protein families database,"Nucleic Acids Res., vol. 30, no. 1, p. 276280, 2002.
15. 'The pfam database of protein families and hmms," August, 2005, http://pfam.wustl.edu/.