Skip Navigation



Bioinformatics Advance Access published online on December 6, 2005

Bioinformatics, doi:10.1093/bioinformatics/bti812
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrowOA All Versions of this Article:
22/6/716    most recent
bti812v1
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 PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Google Scholar
Right arrow Articles by Gesell, T.
Right arrow Articles by von Haeseler, A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Gesell, T.
Right arrow Articles by von Haeseler, A.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2005). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received July 22, 2005
Revised December 1, 2005
Accepted December 1, 2005

Article

In silico sequence evolution with site-specific interactions along phylogenetic trees

Tanja Gesell 1 and Arndt von Haeseler 2 *

1 Heinrich-Heine University Duesseldorf, Universitaetsstrasse 1, 40225 Duesseldorf, Germany
2 Center for Integrative Bioinformatics Vienna, Max F. Perutz Laboratories, Dr. Bohr-Gasse 9, A-1030 Vienna, Austria; University of Vienna, Vienna, Austria; Medical University of Vienna, Vienna, Austria; University of Veterinary Medicine Vienna, Vienna, Austria

* To whom correspondence should be addressed.
Arndt von Haeseler, E-mail: sissi{at}cs.uni-duesseldorf.de


   Abstract

Motivation: A biological sequence usually has many sites whose evolution depends on other positions of the sequence, but this is not accounted for by commonly used models of sequence evolution. Here we introduce a Markov model of nucleotide sequence evolution in which the instantaneous substitution rate at a site depends on the states of other sites. Based on the concept of neighbourhood systems, our model represents a universal description of arbitrarily complex dependencies among sites.

Results: We show how to define complex models for some illustrative examples and demonstrate that our method provides a versatile resource for simulations of sequence evolution with site-specific interactions along a tree. For example, we are able to simulate the evolution of RNA taking into account both secondary structure as well as pseudoknots and other tertiary interactions. To this end we have developed a program (SISSI) that simulates evolution of a nucleotide sequence along a phylogenetic tree incorporating user defined site-specific interactions. Furthermore, our method allows to simulate more complex interactions among nucleotide and other character based sequences.

Availability: We implemented our method in an ANSI C program (SISSI) which runs on UNIX/Linux, Windows and Mac OS systems, including Mac OS X. SISSI is available at http://www.bi.uni-duesseldorf.de/software/sissi/.


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
Syst BiolHome page
B. Misof and K. Misof
A Monte Carlo Approach Successfully Identifies Randomness in Multiple Sequence Alignments: A More Objective Means of Data Exclusion
Syst Biol, May 20, 2009; (2009) syp006v1.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
C. L. Strope, S. D. Scott, and E. N. Moriyama
indel-Seq-Gen: A New Protein Family Simulator Incorporating Domains, Motifs, and Indels
Mol. Biol. Evol., March 1, 2007; 24(3): 640 - 649.
[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.