Steps toward accurate reconstructions of phylogenies from gene-order data.

DOI10.1016/S0022-0000(02)00007-7zbMath1058.68531OpenAlexW2026452889MaRDI QIDQ1872721

Li-San Wang, Jijun Tang, Bernard M. E. Moret, Tandy J. Warnow

Publication date: 14 May 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(02)00007-7

zbMATH Keywords

distanceEvolutionaryAncestral genomeBreakpoint analysisDistance estimatorGenome rearrangementInversion distance

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Related Items (7)

Exemplar or matching: modeling DCJ problems with unequal content genome data ⋮ Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem ⋮ A lower bound for the breakpoint phylogeny problem ⋮ Alignments of mitochondrial genome arrangements: applications to metazoan phylogeny ⋮ A phase transition for a random cluster model on phylogenetic trees. ⋮ Reversal and transposition medians ⋮ Rearrangements in Phylogenetic Inference: Compare, Model, or Encode?

Uses Software

• GRAPPA

Cites Work

• The performance of neighbor-joining methods of phylogenetic reconstruction
• Estimating true evolutionary distances between genomes
• A $k$-Sample Model in Order Statistics
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Steps toward accurate reconstructions of phylogenies from gene-order data.