- We are sorry, but NCBI web applications do not support your browser and may not function properly. More information

- Journal List
- BMC Bioinformatics
- v.6; 2005
- PMC1261159

# SIMPROT: Using an empirically determined indel distribution in simulations of protein evolution

^{1}Andrew D Smith,

^{3}Paulo AS Nuin,

^{1}and Elisabeth RM Tillier

^{}

^{1,}

^{2}

^{1}Ontario Cancer Institute, University Health Network, Toronto, Ontario, Canada

^{2}Dept. Medical Biophysics, University of Toronto, Toronto, Ontario, Canada

^{3}Cold Spring Harbor Laboratory, 1 Bungtown Road, Cold Spring Harbor, NY 11724 USA

^{}Corresponding author.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## Abstract

### Background

General protein evolution models help determine the baseline expectations for the evolution of sequences, and they have been extensively useful in sequence analysis and for the computer simulation of artificial sequence data sets.

### Results

We have developed a new method of simulating protein sequence evolution, including insertion and deletion (indel) events in addition to amino-acid substitutions. The simulation generates both the simulated sequence family and a true sequence alignment that captures the evolutionary relationships between amino acids from different sequences. Our statistical model for indel evolution is based on the empirical indel distribution determined by Qian and Goldstein. We have parameterized this distribution so that it applies to sequences diverged by varying evolutionary times and generalized it to provide flexibility in simulation conditions. Our method uses a Monte-Carlo simulation strategy, and has been implemented in a C++ program named Simprot.

### Conclusion

Simprot will be useful for testing methods of analysis of protein sequence families particularly alignment methods, phylogenetic tree building, detection of recombination and horizontal gene transfer, and homology detection, where knowing the true course of sequence evolution is essential.

## Background

Protein evolution has been largely modelled by considering the amino acid substitution process. There have been few statistical studies of the processes of insertion and deletion. Thorne *et al*. (1991) [2] described a theoretical parametric model that has been used to model the processes of insertion and deletion of single amino acids. The model has been extended, and others developed, to include the consideration of longer indels ([3-5]), however a model based on actual sequences may be more realistic and therefore preferable.

The study Benner, Cohen and Gonnet (1993) [6] is therefore a landmark one. The distribution of indels length was empirically determined from the alignment of conserved proteins with less than 100 PAM units of sequence divergence. This limit on the range of divergence was established in order to reduce both the redundancy of indel events counted, and the numbers of indels that resulted from independent overlapping events. In that study and in a more recent update [7], the estimate for the indel length distribution fit to a Zipfian distribution.

The study of Qian and Goldstein (2001) [1] on the other hand, derived an empirical distribution for the length of indels from a database of protein alignments sharing no more than 25% sequence identity. The distribution in that case fit a linear combination of 4 exponential functions. We call this function the Qian-Goldstein distribution and the Zipfian distributions found by [7] and [6], the Benner distributions. The Qian-Goldstein distribution is more applicable to protein sequence comparisons with long sequence divergence whereas the Benner distributions are more applicable to sequences of lower divergence. The Qian-Goldstein distribution was derived for the determination of realistic gap insertion and deletion penalties that are generally used in alignment algorithms. These affine gap penalties are used to mimic the fact that although insertions and deletions are rare events, they often involve more than one amino acid. That observation reflects the fact that some regions of protein sequence and structure are able to tolerate sections of insertion or deletion.

The evolutionary processes of mutation and subsequent natural selection determine the occurrence of substitutions, insertions and deletion. The specifics of the processes are difficult to model accurately since they are determined by many factors at all context levels (i.e. the population, the genome, the cell, and particularly the DNA and protein sequence and structure). However general protein evolution models are useful as they can help determine the baseline expectations for the evolution of sequences, and they have been extensively used for the computer simulation of artificial sequence data sets.

Two freely available programs that generate sets of sequences by Monte Carlo simulation of evolution are Seq-Gen [8,9], and Rose [10]. Seq-Gen generates sequences using a given evolutionary tree, making substitutions according to a specified model. Several models of amino acid substitution are available, including the popular PAM [11] and JTT models [12]. Additionally, Seq-Gen allows rates of evolution to vary between sites according to the gamma model developed by Yang [13]. Seq-Gen only considers substitutions and does not simulate the processes of insertion and deletion. On the other hand, the Rose program does simulate insertions and deletions, along with substitutions, but has the disadvantage of not allowing for different rates of evolution at different sites. The user determines the distribution of indel length used by Rose software. That distribution is then fixed and does not depend on evolutionary time (*i.e*. branch length in the tree); only the frequency of indels is determined by the branch length separating the ancestral and daughter sequences.

The empirically derived distribution of Qian-Goldstein [1] was obtained using a subset of structural sequence alignments corresponding to highly diverged sequences in the database. The distribution as such is limited to models of proteins corresponding to this set of circumstances. Although the Qian-Goldstein distribution is fixed with respect to evolutionary time, it has the property of being easily parameterized. We generalized the model so that it applies to proteins with variable sequence divergence and show that this generalized distribution may be comparable to the Benner distribution [7] at shorter evolutionary distances. We implemented our generalized Qian-Goldstein distribution in a new program for the simulation of protein sequences (Simprot). Like earlier programs, Simprot allows for several models of amino acid substitution, and permits gamma distributed sites rates according to the Yang [13] model. By incorporating our parameterized Qian-Goldstein model for indels, the user has flexibility to modify the distribution and obtain longer/shorter or more/less frequent insertions and deletions. Simprot is the first program to simulate protein sequence evolution with the additional capability of being able to simulate indels with a variable length distribution. Additionally, Simprot allows the protein sequence to be segmented such that the different segments can evolve with distinct sets of parameters and tree.

## Results

### Parametrization of the Qian-Goldstein indel length distribution

The empirically derived Qian-Goldstein distribution [1] (equation 8 in that paper) is given by

$\begin{array}{l}\begin{array}{ccc}QG(n)& =& 1.027\times {10}^{-2}{e}^{-n/0.96}\end{array}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\begin{array}{lll}\hfill & \hfill & +\text{\hspace{0.17em}}\text{\hspace{0.17em}}3.031\times {10}^{-3}{e}^{-n/3.13}\hfill \end{array}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\begin{array}{ccc}& & +\text{\hspace{0.17em}}\text{\hspace{0.17em}}6.141\times {10}^{-4}{e}^{-n/14.3}\text{}\left(1\right)\end{array}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\begin{array}{ccc}& & +\text{\hspace{0.17em}}\text{\hspace{0.17em}}2.090\times {10}^{-5}{e}^{-n/81.7}.\end{array}\end{array}$

This function describes the frequency of an indel, of any length *n *> 0, as a fraction of the average length of the protein sequence. The model accurately describes a data set of aligned sequences with less than 25% sequence identity. The total frequency of indels is estimated by ∑_{n > 0}*QG*(*n*), which converges rapidly to 0.0238. This value is close to the observed frequency of indels (0.030) that was found by Qian and Goldstein in database they analyzed [1].

As mentioned above, the dataset used to infer Equation 1 was highly diverged, so we may assume it accurately applies to sequences of large divergence. We will therefore assume that the Qian-Goldstein applies at an evolutionary distance *c*, a parameter to which evolutionary time *t *will be scaled. This allows us to define *QG*'(*n*, *t*, *c*) = *QG*(*n*) for *n *> 0 and *t *= *c*.

However this only defines the *QG*' function at one evolutionary time point, *t *= *c*. It is necessary to define the expected distribution of observed indel lengths for all evolutionary times. The Qian-Goldstein distribution describes the *observed *length frequency after a large amount of divergence, but it does not describe the *actual *distribution of the expected rate of fixation in the population of insertion and deletion mutations (the rate of indel occurrence). This is because a single observed indel may have been the result of several actual events. Even if the length distribution for indel occurrences were known, a Markov model for the process of insertion and deletion would need to be established and used to derive the expected distribution of observed indels for any given degree of divergence. Additional empirical data is needed to derive the expected distribution of observed indel lengths scaled to other divergence times.

In the absence of additional empirical data, we must make some assumptions about the insertion and deletion processes to derive the indel length distribution for all evolutionary time.

1. We assume that the length of indels will increase with evolutionary time as larger indels are more easily tolerated and smaller ones overlap. We therefore expect that shorter indels arise over smaller divergence times and that larger indels are the result of independent but contiguous events. We design the distribution such that it is has the property that the limit as time goes to 0 for the expected frequency of all indels (>1), is also 0. This assumes that the instantaneous rate of an indel involves only a single amino acid, which is unlikely (see for example [14]). The assumption is only approximatively true even if the mutation process created only single amino acid indels because multiple mutations may be fixed by natural selection and genetic drift. The effect on the indel model will be that the lengths of indels may be underestimated for very low sequence divergence.

2. We design the distribution such that it is time-reversible. This makes the assumptions that the probability of insertions is equal to the frequency of deletions and that these have equal length distributions. Data from DNA genome level comparisons [15,16] indicate these assumption are not necessarily true, but the effects of this on the long range evolution in proteins is not clear. The Qian-Goldstein and Benner distributions assume time reversibility since the direction of events was not known for the protein sequences they analyzed. Time-reversibility is a desirable mathematical property that is often used in sequence analysis programs for alignment and phylogeny.

3. We assume that the observed indel length distribution keeps its original form as a sum of four exponential terms at any fixed time point, and not just for time *t *= *c*. This is consistent with the assumption in the original Qian-Goldstein distribution, which fits four exponential terms. Using a function of this form allows us to scale the exponential in each term separately.

4. There are still many ways to introduce the time parameter *t *into the function. Our third assumption was then to chose a simple linear scaling of the exponents of the function with time. We found this scaling to give reasonable results when we compare the Benner distributions which were obtained at shorter time scales (see below).

With these assumptions, we then define the scaled *QG*' function for *n *> 0 as

$\begin{array}{l}QG\text{'}(n,t,c)=1.027\times {10}^{-2}{e}^{-nc/0.96t}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}+\text{\hspace{0.17em}}\text{\hspace{0.17em}}3.031\times {10}^{-3}{e}^{-nc/3.13t}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}+\text{\hspace{0.17em}}\text{\hspace{0.17em}}6.141\times {10}^{-4}{e}^{-nc/14.3t\text{}\left(2\right)}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}+\text{\hspace{0.17em}}\text{\hspace{0.17em}}2.090\times {10}^{-5}{e}^{-nc/81.7t}.\end{array}$

To turn equation 2 into a probability distribution (which sums to 1), we must divide the function by the sum of all values for *n *> 0 such that that

$GQ{G}_{c}(n,t)=\frac{QG\text{'}(n,t,c)}{{\sum}_{n=1}^{\infty}QG\text{'}(n,t,c)}.\text{}\left(3\right)$

We call *GQG *the Generalized Qian-Goldstein distribution. *GQG *is a scaled version of the *QG *function that describes the probability distribution of indels of length *n *(conditional on *n *> 0) at any evolutionary time *t *and assuming an evolutionary scale factor *c*.

In Figure Figure11 the distribution of indel lengths is shown plotted for varying values of *c *and *t*. In figure figure2,2, we compare the GQG distribution (with parameters *c *= 3 and PAM 50, which are very appropriate) with the data from [7] which was obtained from sequence comparisons of PAM < 100. The striking fit of the GQG distribution to data of much lower sequence divergence indicates that our scaling of the original QG distribution is appropriate.

*GCG*distribution of indel length is determined by the evolutionary distance for a given evolutionary scale factor

*c*. The expected frequency of indels of given lengths are plotted. In

**a**. the distribution is shown for different evolutionary distances

**...**

*c*= 3 and

*t*= PAM 50. These values were chosen

**...**

Once defined in this way, the *GQG *does not give the frequency of indels (only their length distribution). The rates for the assumed four independent poisson processes for the appearance of indels can be combined into a single instantaneous rate *z*. The frequency of indels defines *p *such that

*p *= 1 - *e*^{-zt/c}. (4)

We define the indel frequency rate *p *as a parameter from which *z *can be calculated. Figure Figure33 shows the frequency of indels as *z *is increased for different values of the parameter *c *such that *p *= 0.03 (the observed Qian-Goldstein frequency).

*GCG*distribution is determined by the indel rate

*z*(

*x*-axis) and the evolutionary scale factor

*c*(labelled next to the corresponding line). This probability can be set by the user to influence the number of indels present in

**...**

By introducing parameters in the distribution, we allow a large amount of flexibility in the generation of indels and on their lengths. The indel frequency parameter *p *can modify the indel *frequency *and the evolutionary scale factor *c *parameter can be used to independently modify the distribution of indel *lengths*. Larger values of *p *will yield more indels and smaller values of will yield fewer indels. Larger values of *c *will yield shorter indels and smaller values of *c *will yield larger indels.

The original impetus for the estimation of the indel distribution was to derive gap insertion (*γ*_{I}) and gap extension (*γ*_{E}) penalties for use in alignment programs [1]. We used the formulas from [1] to derive an approximation for the natural log odds penalties for gaps

${\gamma}_{E}\approx \frac{GQ{G}_{c}(3,t)-GQ{G}_{c}(1,t)}{2GQ{G}_{c}(2,t)}\text{}\left(5\right)$

${\gamma}_{I}\approx \mathrm{log}\left(\frac{p}{1-{e}^{{\gamma}_{E}}}\right)+{2}_{{\gamma}_{E}}.\text{}\left(6\right)$

## Implementation

We have implemented the Generalized Qian-Goldstein distribution in a program called Simprot to simulate protein sequence evolution. Given a bifurcating phylogenetic tree, children sequences inherit the sequence of their parent with modification due to mutation events. The number of mutations expected depends on the length of evolutionary time that separates the child from the parent and their type is determined by the chosen models. Substitutions are made according to the user-chosen substitution model. Insertions and deletions are made according to the *GQG *model described above. The user determines the values of the evolutionary scale factor *c *which controls the indel length distribution, and the indel frequency rate *p *which determines their frequencies. The shape parameter for the gamma model of [13] distribution of evolutionary rates is also determined by the user.

The parameters for the models are input via an interface screen (available through the Web, or by download for local Windows and Unix/Linux systems). The locally installed versions allow several input screens such that the resulting simulated protein sequences will consist of segments each evolving according to its own set of parameters and tree.

The program generates sequences according to the chosen indel and substitution models and outputs the alignments of sequences from the terminal branches. When several protein segments have been selected, the sequences are appropriately fused into single sequences by matching the names of the terminal taxons in the input tree files. The gap opening and gap extension penalties corresponding to the input parameters and time *t *= *c *for each protein segment is an additional output provided by the program for user reference.

### Evolution

Each protein segment is simulated independently. Simprot parses the given tree file into a tree structure to use as a guide in simulating evolution. It then generates a random amino acid sequence of given length *r *at the root of the tree according to the equilibrium frequency of amino acids in the substitution model. Each amino acid site is assigned a rate of evolution based on the gamma distribution. The program then recursively generates mutations on the protein sequence at each of the tree nodes. There are two types of mutations: insertion/deletion and substitution. Indels are performed before substitutions at each tree node.

#### Number of indels

Simprot assumes a Poisson process for insertion and deletions and thus the expected frequency of indels (of any length) in a sequence is

*p *= 1 - *e*^{-zt/c}, (7)

where *z *is the indel probability and *t *is the branch length to the daughter sequence which is scaled by the evolutionary scale factor. For each amino acid site, a uniformly distributed random number is picked to check whether it is lower than the expected frequency. The number of times this happens over the entire sequence becomes the number of indels that will be performed.

#### Indel positions

Indel sites are chosen according to their rate of evolution as given by the gamma distribution. This means that sites more likely to substitute will also be more likely to have an insertion or deletion.

#### Indel length

To determine the length of an indel after choosing to create one, the cumulative distribution function (CDF) of the indel-length probabilities for *n *> 0 as determined by the *GQG *model is evaluated using Eq. 3. A cap on the indel length is also applied. Indels must be shorter than the maximum indel length or 5% of the sequence length (whichever is smaller).

#### Indel type

Simprot chooses between insertion and deletion with equal probability. If insertion is chosen, an amino acid sequence of the indel length is generated (according to the same amino acid frequency distribution that generated the root sequence) and inserted before the indel position. If deletion is chosen, the indel length of amino acids are deleted beginning with the current position. If the length of the indel is greater than the number of amino acids in the sequence following the current position, additional amino acids are deleted towards the start of the sequence.

The probability of amino acids being inserted and deleted is the same so that the length of the sequences should remain approximately the same. The sequence is updated after each indel event and all indels are performed before substitutions.

#### Substitutions

Once all indels have been performed at a given node, Simprot performs substitutions of the individual amino acid according to the evolutionary substitution model. Currently the models implemented are PAM, JTT and PMB. The substitution probabilities are calculated from the previously calculated eigenvalue decomposition of the probability matrix. This strategy, first used by Felsenstein in the Phylip package [17] facilitates computation of the substitution probabilities for any branch length. The model considers the probability of all amino acid substitutions for a given branch length times the evolutionary rate at the site (as determined by the gamma model). As the program traverses the tree, the descendant nodes inherit the mutations generated.

### Alignment

A copy of the "true" sequence alignment is also produced for the generated sequence family. At each node, the locations of insertions and deletions are maintained relative to the sequence at the parent node. This correspondence is called the "gapped sequence" because gap characters (-) are inserted in copies of both the current sequence and the parent sequence to represent the correspondence. After the sequence family has been generated, a recursive traversal rebuilds the true alignment using the gapped sequences. The procedure makes use of the fact that, for any node in the tree, the true alignments are known for the sequences in the left and right subtrees from this node, and the gapped sequences can be used to align these two true alignments, producing the true alignment for all sequences below the root. This procedure requires only a linear traversal of the tree, and therefore imposes no significant additional cost of computation. Simprot outputs the aligned sequences from the leaves of the tree in Fasta and Phylip format. It also creates a file of the set of unaligned protein sequences. If the protein is segmented, the files for the segments are merged into the final alignment.

## Conclusion

While the process of amino acid substitution has been extensively studied and modelled, there has been relatively little study of the insertion-deletion process in protein coding sequences [18]. The model we propose may not fit all proteins but it has the properties of being based on an empirically derived distribution, and being flexible so as to allow a user to test many conditions. We plan to use additional empirical data of the frequency and distribution of indels in proteins to refine our model in subsequent releases of Simprot. The alignments generated by Simprot will be useful for testing methods of analysis of protein sequence families. It will be particularly useful for the development of new alignment methods, phylogenetic tree building, detection of recombination and horizontal gene transfer, and homology detection, where knowing the true course of sequence evolution is essential.

## Availability and requirements

Project name: Simprot

Project home page: http://www.uhnresearch.ca/labs/tillier/simprot/

Operating systems: Linux, Windows 95 or later (local installation)

Programming language: C++

License: University of Illinois/NCSA Open Source License

Any restrictions to use by non-academics: no

## List of abbreviations

PMB probability matrix from Blocks, JTT Jones Taylor Thorton, PAM Percent Accepted Mutation, GQG Generalized Qian-Goldstein distribution, CDF cumulative distribution function.

## Authors' contributions

AP implemented the GQG distribution in Simprot and helped draft the manuscript. ADS implemented the indel and substitution processes in Simprot and helped draft the manuscript. PASN implemented the gap penalties, created the GUI interfaces and provided comments on the manuscript. ERMT derived the GQG distribution, supervised the project and approved the final manuscript.

## Acknowledgements

Simprot has been modified and recreated many times over the years and we thank all who have contributed to it: Shalini Veerassamy, Thomas Lui, Zhuozhi Wang, and Ginny Li. We thank Alex Kondrashov and another anonymous reviewer for their comments and suggestions for improving the manuscript. We thank CIHR and Genome Canada for funding.

## References

- Qian B, Goldstein RA. Distribution of Indel lengths. Proteins. 2001;45:102–4. doi: 10.1002/prot.1129. [PubMed] [Cross Ref]
- Thorne JL, Kishino H, Felsenstein J. An evolutionary model for maximum likelihood alignment of DNA sequences. J Mol Evol. 1991;33:114–124. doi: 10.1007/BF02193625. [PubMed] [Cross Ref]
- Thorne JL, Kishino H, Felsenstein J. Inching toward reality: an improved likelihood model of sequence evolution. J Mol Evol. 1999;34:3–16. doi: 10.1007/BF00163848. [PubMed] [Cross Ref]
- Metzler D. Statistical alignment based on fragment insertion and deletion models. Bioinformatics. 2003;19:490–499. doi: 10.1093/bioinformatics/btg026. [PubMed] [Cross Ref]
- Miklos I, Lunter GA, Holmes I. A Long Indel model for evolutionary sequence alignment. Mol Biol Evol. 2004;21:529–40. doi: 10.1093/molbev/msh043. [PubMed] [Cross Ref]
- Benner SA, Cohen MA, Gonnet GH. Empirical and structural models for insertions and deletions in the divergent evolution of proteins. J Mol Biol. 1993;229:1065–82. doi: 10.1006/jmbi.1993.1105. [PubMed] [Cross Ref]
- Chang MS, Benner SA. Empirical analysis of protein insertions and deletions determining parameters for the correct placement of gaps in protein sequence alignments. J Mol Biol. 2004;341:617–31. doi: 10.1016/j.jmb.2004.05.045. [PubMed] [Cross Ref]
- Rambaut A, Grassly NC. Seq-Gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees. Comput Appl Biosci. 1997;13:235–8. [PubMed]
- Grassly NC, Adachi J, Rambaut A. PSeq-Gen: an application for the Monte Carlo simulation of protein sequence evolution along phylogenetic trees. Comput Appl Biosci. 1997;13:559–60. [PubMed]
- Stoye J, Evers D, Meyer F. Rose: generating sequence families. Bioinformatics. 1998;14:157–163. doi: 10.1093/bioinformatics/14.2.157. [PubMed] [Cross Ref]
- Dayhoff MO, Schwartz RM, Orcutt BC. A model of evolutionary change in proteins. In: Dayhoff MO, editor. Atlas of Protein Sequence and Structure. Vol. 5. National Biomedical Research Foundation; 1978. pp. 345–352.
- Jones DT, Taylor WR, Thornton JM. The rapid generation of mutation data matrices from protein sequences. Computer Applications in the Biosciences. 1992;8:275–282. [PubMed]
- Yang Z. Maximum likelihood estimation of phylogeny from DNA sequences when substitution rates differ over sites. Mol Biol Evol. 1993;10:1396–1401. [PubMed]
- Kondrashov AS, Rogozin IB. Context of deletions and insertions in human coding sequences. Hum Mutat. 2004;23:177–85. doi: 10.1002/humu.10312. [PubMed] [Cross Ref] [PubMed] [Cross Ref]
- Ogurtsov A, Aleksey Y, Sunyaev S, Kondrashov AS. Indel-based evolutionary distance and mouse-human divergence. Genome Res. 2004;14:1610–6. doi: 10.1101/gr.2450504. [PMC free article] [PubMed] [Cross Ref]
- Denver D, Morris K, Lynch M, Thomas WK. High mutation rate and predominance of insertions in the Caenorhabditis elegans nuclear genome. 2004;430:679–82. [PubMed]
- Felsenstein J. PHYLIP (phylogeny inference package) version 3.6.3. 2002. Http://evolution.genetics.washington.edu/phylip.html Available via the web.
- Thorne JL. Models of protein sequence evolution and their applications. Curr Opin Genet Dev. 2000;10:602–605. doi: 10.1016/S0959-437X(00)00142-8. [PubMed] [Cross Ref]

**BioMed Central**

## Formats:

- Article |
- PubReader |
- ePub (beta) |
- PDF (267K)

- indel-Seq-Gen: a new protein family simulator incorporating domains, motifs, and indels.[Mol Biol Evol. 2007]
*Strope CL, Scott SD, Moriyama EN.**Mol Biol Evol. 2007 Mar; 24(3):640-9. Epub 2006 Dec 8.* - Scoredist: a simple and robust protein sequence distance estimator.[BMC Bioinformatics. 2005]
*Sonnhammer EL, Hollich V.**BMC Bioinformatics. 2005 Apr 27; 6:108. Epub 2005 Apr 27.* - Simulating DNA coding sequence evolution with EvolveAGene 3.[Mol Biol Evol. 2008]
*Hall BG.**Mol Biol Evol. 2008 Apr; 25(4):688-95. Epub 2008 Jan 12.* - A review on Monte Carlo simulation methods as they apply to mutation and selection as formulated in Wright-Fisher models of evolutionary genetics.[Math Biosci. 2008]
*Mode CJ, Gallop RJ.**Math Biosci. 2008 Feb; 211(2):205-25. Epub 2007 Nov 28.* - Modeling sequence evolution.[Methods Mol Biol. 2008]
*Liò P, Bishop M.**Methods Mol Biol. 2008; 452:255-85.*

- Accurate Simulation and Detection of Coevolution Signals in Multiple Sequence Alignments[PLoS ONE. ]
*Ackerman SH, Tillier ER, Gatti DL.**PLoS ONE. 7(10)e47108* - Simulation of Molecular Data under Diverse Evolutionary Scenarios[PLoS Computational Biology. 2012]
*Arenas M.**PLoS Computational Biology. 2012 May; 8(5)e1002495* - ALF--A Simulation Framework for Genome Evolution[Molecular Biology and Evolution. 2012]
*Dalquen DA, Anisimova M, Gonnet GH, Dessimoz C.**Molecular Biology and Evolution. 2012 Apr; 29(4)1115-1123* - HGT-Gen: a tool for generating a phylogenetic tree with horizontal gene transfer[Bioinformation. ]
*Horiike T, Miyata D, Tateno Y, Minai R.**Bioinformation. 7(5)211-213* - SuiteMSA: visual tools for multiple sequence alignment comparison and molecular sequence simulation[BMC Bioinformatics. ]
*Anderson CL, Strope CL, Moriyama EN.**BMC Bioinformatics. 12184*

- PubMedPubMedPubMed citations for these articles
- TaxonomyTaxonomyRelated taxonomy entry
- Taxonomy TreeTaxonomy Tree

- SIMPROT: Using an empirically determined indel distribution in simulations of pr...SIMPROT: Using an empirically determined indel distribution in simulations of protein evolutionBMC Bioinformatics. 2005; 6()236PMC

Your browsing activity is empty.

Activity recording is turned off.

See more...