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

Accurate construction of consensus genetic maps via integer linear programming.

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

Wu Yonghui, Close Timothy J, Lonardi Stefano

Abstract excerpt

We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which is a directed graph that includes and is consistent with all (or, the vast majority of) the markers in the input maps....

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Chromosome Mapping
Share to Consensus Sequence

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Genetic Linkage

Share to Genomics

Share to Genotype

Share to Software

Source

Identifiers

PMID: 20479505
DOI: 10.1109/TCBB.2010.35

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 2 Sept 2026. Prepared record publication-20479505-2026-09-02.2. Manifest publication-graph-cohort-2026-09-02.2.

Source receipt: PubMed via Helena Literature Corpus, retrieved 2 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Accurate construction of consensus genetic maps via integer linear programming.PMID 20479505Read ↗

The potential of probabilistic graphical models in linkage map construction.Semantic proximity Read ↗

Fast and Efficient Rmap Assembly using the Bi-labelled de Bruijn GraphSemantic proximity Read ↗

Efficient and accurate construction of genetic linkage maps from the minimum spanning tree of a graph.Semantic proximity Read ↗

Combinatorial reconstruction of half-sibling groups from microsatellite data.Semantic proximity Read ↗

Restricted DCJ model: rearrangement problems with chromosome reincorporation.Semantic proximity Read ↗

Super oriented cycles in permutations.Semantic proximity Read ↗

Comparisons of four approximation algorithms for large-scale linkage map construction.Semantic proximity Read ↗

Haplotype assembly from aligned weighted SNP fragments.Semantic proximity Read ↗

Mapping functions.Semantic proximity Read ↗

Rearrangement distance with reversals, indels, and moves in intergenic regions on signed and unsigned permutations.Semantic proximity Read ↗

Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.Semantic proximity Read ↗

Fast and high precision algorithms for optimization in large-scale genomic problems.Semantic proximity Read ↗

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