Skip Navigation


Nucleic Acids Research Advance Access originally published online on May 8, 2009
Nucleic Acids Research 2009 37(11):e80; doi:10.1093/nar/gkp319
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (386K) Freely available
Right arrow Screen PDF (233K) Freely available
Right arrow Supplementary Data
Right arrowOA All Versions of this Article:
37/11/e80    most recent
gkp319v1
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 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 Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Zhou, L.
Right arrow Articles by Florea, L.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Zhou, L.
Right arrow Articles by Florea, L.
Related Collections
Right arrow Computational methods
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2009, Vol. 37, No. 11 e80
© 2009 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.


Methods Online

Sim4cc: a cross-species spliced alignment program

Leming Zhou1, Mihaela Pertea2, Arthur L. Delcher2 and Liliana Florea1,*

1Department of Computer Science, George Washington University, Washington, DC 20052 and 2Center for Bioinformatics and Computational Biology, University of Maryland, College Park, MD 20742, USA

*To whom correspondence should be addressed. Tel: +1 301 405 9901; Fax: +1 301 314 1341; Email: florea{at}umiacs.umd.edu

Received January 6, 2009. Revised March 24, 2009. Accepted April 20, 2009.

Advances in sequencing technologies have accelerated the sequencing of new genomes, far outpacing the generation of gene and protein resources needed to annotate them. Direct comparison and alignment of existing cDNA sequences from a related species is an effective and readily available means to determine genes in the new genomes. Current spliced alignment programs are inadequate for comparing sequences between different species, owing to their low sensitivity and splice junction accuracy. A new spliced alignment tool, sim4cc, overcomes problems in the earlier tools by incorporating three new features: universal spaced seeds, to increase sensitivity and allow comparisons between species at various evolutionary distances, and powerful splice signal models and evolutionarily-aware alignment techniques, to improve the accuracy of gene models. When tested on vertebrate comparisons at diverse evolutionary distances, sim4cc had significantly higher sensitivity compared to existing alignment programs, more than 10% higher than the closest competitor for some comparisons, while being comparable in speed to its predecessor, sim4. Sim4cc can be used in one-to-one or one-to-many comparisons of genomic and cDNA sequences, and can also be effectively incorporated into a high-throughput annotation engine, as demonstrated by the mapping of 64 000 Fagus grandifolia 454 ESTs and unigenes to the poplar genome.


Present addresses: Leming Zhou, Department of Health Information Management, University of Pittsburgh, Pittsburgh, PA 15260, USA.

Liliana Florea, Center for Bioinformatics and Computational Biology, University of Maryland, College Park, MD 20742, USA.


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




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.