347 search results - page 30 / 70 » Visualising phylogenetic trees |
135
click to vote
TALG
2008
15 years 1 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
107
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Phylogenetic footprinting is the identification of functional regions of DNA by their evolutionary conservation. This is achieved by comparing orthologous regions from...
115
click to vote
JCB
2007
15 years 1 months ago
2007
Given a phylogenetic tree for a family of tandemly repeated genes and their signed order on the chromosome, we aim to find the minimum number of inversions compatible with an evo...
117
click to vote
JCB
1998
15 years 1 months ago
1998
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
122
click to vote
TCBB
2010
15 years 8 days ago
2010
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...