371 search results - page 31 / 75 » Algorithms for phylogenetic footprinting |
IPL
2006
15 years 4 months ago
2006
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 the k...
145
click to vote
CCECE
2006
IEEE
15 years 10 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
137
click to vote
ISCC
2005
IEEE
15 years 9 months ago
2005
IEEE
—A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optim...
127
click to vote
RECOMB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Genome doubling simultaneously doubles all genetic markers. Genome rearrangement phylogenetics requires that all genomes analyzed have the same set of orthologs, so that ...
136
click to vote
TCS
2011
14 years 11 months ago
2011
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...