Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
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 (34)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Edgar, R. C.
Right arrow Articles by Sjölander, K.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Edgar, R. C.
Right arrow Articles by Sjölander, K.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 no. 11 2003
Pages 1404-1411
© 2003 Oxford University Press

SATCHMO: sequence alignment and tree construction using hidden Markov models

Robert C. Edgar 1,* and Kimmen Sjölander 2

1 195 Roque Moraes Drive, Mill Valley, CA 94941
2 Department of Bioengineering, University of California, Berkeley, CA 94720, USA

Received on November 17, 2002 ; revised on February 4, 2003 ; accepted on February 7, 2003

Motivation:Aligning multiple proteins based on sequence information alone is challenging if sequence identity is low or there is a significant degree of structural divergence. We present a novel algorithm (SATCHMO) that is designed to address this challenge. SATCHMO simultaneously constructs a tree and a set of multiple sequence alignments, one for each internal node of the tree. The alignment at a given node contains all sequences within its sub-tree, and predicts which positions in those sequences are alignable and which are not. Aligned regions therefore typically get shorter on a path from a leaf to the root as sequences diverge in structure. Current methods either regard all positions as alignable (e.g. ClustalW), or align only those positions believed to be homologous across all sequences (e.g. profile HMM methods); by contrast SATCHMO makes different predictions of alignable regions in different subgroups. SATCHMO generates profile hidden Markov models at each node; these are used to determine branching order, to align sequences and to predict structurally alignable regions.

Results: In experiments on the BAliBASE benchmark alignment database, SATCHMO is shown to perform comparably to ClustalW and the UCSC SAM HMM software. Results using SATCHMO to identify protein domains are demonstrated on potassium channels, with implications for the mechanism by which tumor necrosis factor alpha affects potassium current.

Availability: The software is available for download from http://www.drive5.com/lobster/index.htm

Contact: bob{at}drive5.com

* To whom correspondence should be addressed.


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
N. Fernandez-Fuentes, B. K. Rai, C. J. Madrid-Aliste, J. Eduardo Fajardo, and A. Fiser
Comparative protein structure modeling by combining multiple templates and optimizing sequence-to-structure alignments
Bioinformatics, October 1, 2007; 23(19): 2558 - 2565.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
J. G. Glanville, D. Kirshner, N. Krishnamurthy, and K. Sjolander
Berkeley Phylogenomics Group web servers: resources for structural phylogenomic analysis
Nucleic Acids Res., July 13, 2007; 35(suppl_2): W27 - W32.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
T. M. Phuong, C. B. Do, R. C. Edgar, and S. Batzoglou
Multiple alignment of protein sequences with repeats and rearrangements
Nucleic Acids Res., November 6, 2006; 34(20): 5932 - 5942.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. Cheng and P. Baldi
A machine learning information retrieval approach to protein fold recognition
Bioinformatics, June 15, 2006; 22(12): 1456 - 1463.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
H. Zhou and Y. Zhou
SPEM: improving multiple sequence alignment with sequence profiles and predicted secondary structures
Bioinformatics, September 15, 2005; 21(18): 3615 - 3621.
[Abstract] [Full Text] [PDF]


Home page
Plant Physiol.Home page
L. K. Fritz-Laylin, N. Krishnamurthy, M. Tor, K. V. Sjolander, and J. D.G. Jones
Phylogenomic Analysis of the Receptor-Like Proteins of Rice and Arabidopsis
Plant Physiology, June 1, 2005; 138(2): 611 - 623.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. Soding
Protein homology detection by HMM-HMM comparison
Bioinformatics, April 1, 2005; 21(7): 951 - 960.
[Abstract] [Full Text] [PDF]


Home page
Hum Mol GenetHome page
H.-Y. Lee, Y. Xu, Y. Huang, A. H. Ahn, G. W.J. Auburger, M. Pandolfo, H. Kwiecinski, D. A. Grimes, A. E. Lang, J. E. Nielsen, et al.
The gene for paroxysmal non-kinesigenic dyskinesia encodes an enzyme in a stress response pathway
Hum. Mol. Genet., December 15, 2004; 13(24): 3161 - 3170.
[Abstract] [Full Text] [PDF]


Home page
Protein Sci.Home page
H. Viklund and A. Elofsson
Best {alpha}-helical transmembrane protein topology predictions are achieved using hidden Markov models and evolutionary information
Protein Sci., July 1, 2004; 13(7): 1908 - 1917.
[Abstract] [Full Text] [PDF]


Home page
Protein Sci.Home page
M. A. Marti-Renom, M.S. Madhusudhan, and A. Sali
Alignment of protein sequences by their profiles
Protein Sci., April 1, 2004; 13(4): 1071 - 1087.
[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.