Skip Navigation


Bioinformatics Advance Access originally published online on November 15, 2006
Bioinformatics 2007 23(3):289-297; doi:10.1093/bioinformatics/btl578
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary data
Right arrow All Versions of this Article:
23/3/289    most recent
btl578v1
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 (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kim, J.
Right arrow Articles by Sinha, S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Kim, J.
Right arrow Articles by Sinha, S.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Indelign: a probabilistic framework for annotation of insertions and deletions in a multiple alignment

Jaebum Kim and Saurabh Sinha *

Department of Computer Science, University of Illinois, Urbana-Champaign Urbana, IL, USA

*To whom correspondence should be addressed.


   Abstract

Motivation: A quantitative study of molecular evolutionary events such as substitutions, insertions and deletions from closely related genomes requires (1) an accurate multiple sequence alignment program and (2) a method to annotate the insertions and deletions that explain the ‘gaps’ in the alignment. Although the former requirement has been extensively addressed, the latter problem has received little attention, especially in a comprehensive probabilistic framework.

Results: Here, we present Indelign, a program that uses a probabilistic evolutionary model to compute the most likely scenario of insertions and deletions consistent with an input multiple alignment. It is also capable of modifying the given alignment so as to obtain a better agreement with the evolutionary model. We find close to optimal performance and substantial improvement over alternative methods, in tests of Indelign on synthetic data. We use Indelign to analyze regulatory sequences in Drosophila, and find an excess of insertions over deletions, which is different from what has been reported for neutral sequences.

Availability: The Indelign program may be downloaded from the website http://veda.cs.uiuc.edu/indelign/

Supplementary information: Supplementary material is available at Bioinformatics online.

Contact: sinhas{at}uiuc.edu

Associate Editor: John Quackenbush


Received on August 24, 2006; revised on October 19, 2006; accepted on November 13, 2006

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
Mol Biol EvolHome page
R. A. Cartwright
Problems and Solutions for Estimating Indel Rates and Length Distributions
Mol. Biol. Evol., February 1, 2009; 26(2): 473 - 480.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
M. S. Halfon, S. M. Gallo, and C. M. Bergman
REDfly 2.0: an integrated database of cis-regulatory modules and transcription factor binding sites in Drosophila
Nucleic Acids Res., January 11, 2008; 36(suppl_1): D594 - D598.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
R. K. Bradley and I. Holmes
Transducers: an emerging probabilistic framework for modeling indels on trees
Bioinformatics, December 1, 2007; 23(23): 3258 - 3262.
[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.