Skip Navigation


Bioinformatics Advance Access originally published online on March 25, 2004
Bioinformatics 2004 20(14):2175-2180; doi:10.1093/bioinformatics/bth181
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow All Versions of this Article:
20/14/2175    most recent
bth181v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Qian, B.
Right arrow Articles by Goldstein, R. A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Qian, B.
Right arrow Articles by Goldstein, R. A.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics 20(14) © Oxford University Press 2004; all rights reserved.

Performance of an iterated T-HMM for homology detection

Bin Qian 1,{dagger} and Richard A. Goldstein 2,*

1 Biophysics Research Division, University of Michigan, Ann Arbor, MI 48109-1055, USA and 2 Division of Mathematical Biology, National Institute for Medical Research, The Ridgeway, Mill Hill, London, NW7 1AA, UK

Received on August 14, 2003; revised on March 1, 2004; accepted on March 3, 2004
Advance Access Publication March 25, 2004

Motivation: Much information about new protein sequences is derived from identifying homologous proteins. Such tasks are difficult when the evolutionary relationships are distant. Some modern methods achieve better results by building a model of a set of related sequences, and then identifying new proteins that fit the model. A further advance was the development of iterative methods that refine the model as more homologs are discovered. These methods are generally limited by ad hoc methods of sequence weighting, neglect of underlying evolutionary relationships and the representation of the set with a single one-size-fits-all model. These limitations are avoided through the use of a Tree hidden Markov model (T-HMM) approach. Our previous work described how a non-iterative version of the T-HMM method could identify distant homologs with superior performance compared with other non-iterated approaches, and described how this method was particularly appropriate for being implemented as an iterative algorithm.

Results: We describe an iterative version of the T-HMM algorithm, and evaluate its performance for the detection of distant homologs. Significant improvement over other commonly used methods is found.

Availability: The software (C++, Perl) is available from the corresponding author.

Contact: richard.goldstein{at}nimr.mrc.ac.uk

* To whom correspondence should be addressed.

{dagger} Present address: Department of Biochemistry, University of Washington, WA 98195, USA.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
W. S.W. Wong and R. Nielsen
Finding cis-regulatory modules in Drosophila using phylogenetic hidden Markov models
Bioinformatics, August 15, 2007; 23(16): 2031 - 2037.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Q.-w. Dong, X.-l. Wang, and L. Lin
Application of latent semantic analysis to protein remote homology detection
Bioinformatics, February 1, 2006; 22(3): 285 - 290.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.