Reconstructing an ancestral genome using minimum segments duplications and reversals.

DOI10.1016/S0022-0000(02)00003-XzbMath1058.68529OpenAlexW1999792620MaRDI QIDQ1872714

Nadia El-Mabrouk

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)00003-x

zbMATH Keywords

phylogenetic treetight boundsPevzner graph

Mathematics Subject Classification ID

Searching and sorting (68P10) Protein sequences, DNA sequences (92D20)

Related Items (5)

Approximating reversal distance for strings with bounded number of duplicates ⋮ Genome Halving under DCJ Revisited ⋮ A small trip in the untranquil world of genomes: a survey on the detection and analysis of genome rearrangement breakpoints ⋮ Algorithmic improvements to species delimitation and phylogeny estimation under the multispecies coalescent ⋮ A sparse dynamic programming algorithm for alignment with non-overlapping inversions

Uses Software

• Genetree

Cites Work

• Sorting by Transpositions
• The Reconstruction of Doubled Genomes
• Polynomial-time algorithm for computing translocation distance between genomes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructing an ancestral genome using minimum segments duplications and reversals.