2003
DOI: 10.1103/physrevlett.90.018101
|View full text |Cite
|
Sign up to set email alerts
|

Minimal Model for Genome Evolution and Growth

Abstract: Textual analysis of typical microbial genomes reveals that they have the statistical characteristics of a DNA sequence of a much shorter length. This peculiar property supports an evolutionary model in which a genome evolves by random mutation but primarily grows by random segmental duplication. That genomes grew mostly by duplication is consistent with the observation that repeat sequences in all genomes are widespread and intragenomic and intergenomic homologous genes are preponderant across all life forms.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
48
0

Year Published

2003
2003
2020
2020

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 43 publications
(48 citation statements)
references
References 24 publications
0
48
0
Order By: Relevance
“…2, 3, 4 and 5 results that agree quite well with genomic data for all k= 2 to 9, it is far easier than not for our model to generate results that are good for one particular k and not for the other k's. For example, in our first application of the model in which a much longer average duplicated segment length than 25 b was used, only 6-distributions were well reproduced but not the others [14].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…2, 3, 4 and 5 results that agree quite well with genomic data for all k= 2 to 9, it is far easier than not for our model to generate results that are good for one particular k and not for the other k's. For example, in our first application of the model in which a much longer average duplicated segment length than 25 b was used, only 6-distributions were well reproduced but not the others [14].…”
Section: Discussionmentioning
confidence: 99%
“…This model hasl = 25 and δ l = 11.2. There is nothing special about the Erlang function except that it was a simple generalize function of the exponential functionthat we used in the first instnace -and that it provided a simple setting for discrete parameter search: after we realizedl needed to be less than 50, we scannedl in intervals of 5 and n in intervals The following are some examples that gave very good k-distributions for specific k-mers but not generally; all were generated with L 0 = 1000 and n = 0: for 6-mer, σ = 13, 000 ± 2, 000 and on average 0.04σ mutations per duplication (these parameters also work for genomes with biased base compositions) [14]; for 2-mer, σ = 50, no mutation; for 5-mer, σ = 30, no mutation; for 9-mer, σ = 15, no mutation.…”
Section: Generation Of Model Sequencementioning
confidence: 99%
“…There are at least two ways around this firstly, the genome might already contain highly repeated subsequences; one of those might then be used as a signal sequence, thus avoiding the difficulty of having to evolve one. Recent research has established that typical genomes do indeed contain highly over-represented oligomeres (Hsieh et al, 2003).…”
Section: Emergence Of the Uss Under The Pfhmentioning
confidence: 99%
“…One example where this could be the case is the evolution of chemical systems, such as for example cell signaling networks [5]. Furthermore, there is strong evidence that growth phenomena are important in the evolution of real genomes [9].…”
Section: Introductionmentioning
confidence: 99%