Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Reconstructing recombination network from sequence data: the small parsimony problem.

IEEE/ACM transactions on computational biology and bioinformatics - 1 Jan 2000

Nguyen C Thach, Nguyen Nguyen Bao, Sung Wing-Kin, Zhang Louxin

Abstract excerpt

The small parsimony problem is studied for reconstructing recombination networks from sequence data. The small parsimony problem is polynomial-time solvable for phylogenetic trees. However, the problem is proved NP-hard even for galled recombination networks. A dynamic programming algorithm is also developed to solve the small parsimony problem. It takes O(dn2(3h)) time on an input recombination network over...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Computer Simulation

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to DNA Mutational Analysis

Share to Evolution, Molecular

Share to Models, Genetic

Share to Recombination, Genetic

Share to Sequence Analysis, DNA

Share to Signal Transduction

Source

Identifiers

PMID: 17666759
DOI: 10.1109/tcbb.2007.1018

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 6 Sept 2026. Manifest publication-graph-cohort-2026-09-06.1.

Source receipt: pubmed, retrieved 6 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Reconstructing recombination network from sequence data: the small parsimony problem.PMID 17666759Read ↗

Optimal, efficient reconstruction of phylogenetic networks with constrained recombination.Semantic proximity Read ↗

Towards a Unified Exact Solution of Rearrangement Small Parsimony for Natural GenomesSemantic proximity Read ↗

Genome halving and double distance with losses.Semantic proximity Read ↗

Inferring horizontal transfers in the presence of rearrangements by the minimum evolution criterion.Semantic proximity Read ↗

Reconstructing reticulate evolution in species-theory and practice.Semantic proximity Read ↗

On the minimum number of recombination events in the evolutionary history of DNA sequences.Semantic proximity Read ↗

A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem.Semantic proximity Read ↗

Recoverability of ancestral recombination graph topologies.Semantic proximity Read ↗

Computing recombination networks from binary sequences.Semantic proximity Read ↗

The number of recombination events in a sample history: conflict graph and lower bounds.Semantic proximity Read ↗

Detection of homologous recombination events in bacterial genomes.Semantic proximity Read ↗

The infinite sites model of genome evolution.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.