1995
DOI: 10.1016/0169-2607(94)01609-j
|View full text |Cite
|
Sign up to set email alerts
|

Construction of molecular evolutionary phylogenetic trees from DNA sequences based on minimum complexity principle

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2005
2005
2009
2009

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…This would be a means to better understand what some biophysicists call the "complexity principle " in contemporary evolutionistic approaches. More 936 C. Riedberger AACA precisely, these daring ideas, which could have been derived from Clifford's, have recently been applied to the construction of molecular evolutionary phylogenetic trees (24). After Clifford, I believe that it would be interesting to see if any sort of "informational" kernel should prove to underlie the structure and dynamical behaviour of matter.…”
Section: A New Quantum Model Of the Mindmentioning
confidence: 99%
“…This would be a means to better understand what some biophysicists call the "complexity principle " in contemporary evolutionistic approaches. More 936 C. Riedberger AACA precisely, these daring ideas, which could have been derived from Clifford's, have recently been applied to the construction of molecular evolutionary phylogenetic trees (24). After Clifford, I believe that it would be interesting to see if any sort of "informational" kernel should prove to underlie the structure and dynamical behaviour of matter.…”
Section: A New Quantum Model Of the Mindmentioning
confidence: 99%
“…The best hypothesis is the one that minimizes the length of the description of the hypothesis plus the length of the description of the data when encoded or compressed with the help of that hypothesis. Scientific inference based on some version of this idea has been applied to many biological problems, including sequence alignment (Allison et al, 1999(Allison et al, , 2000Allison and Yee, 1990), phylogeny reconstruction (Cheeseman and Kanefsky, 1993;Li et al, 2001;Milosavljevic et al, 1990;Otu and Sayood, 2003;Ren et al, 1995), and comparison of classifications (Day, 1983), though not to collections of trees constructed from separate data sets. In this framework, a hypothesis is either a tree or a collection of trees and the best hypothesis is the one that permits the maximum compression of that hypothesis plus the sequence alignment.…”
mentioning
confidence: 99%