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

Fast and high precision algorithms for optimization in large-scale genomic problems.

Computational biology and chemistry - 1 Oct 2004

Mester D I, Ronin Y I, Nevo E, Korol A B

Abstract excerpt

There are several very difficult problems related to genetic or genomic analysis that belong to the field of discrete optimization in a set of all possible orders. With n elements (points, markers, clones, sequences, etc.), the number of all possible orders is n!/2 and only one of these is considered to be the true order. A classical formulation of a similar mathematical problem is the well-known traveling...

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 Computer Simulation

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Evolution, Molecular

Share to Genetic Linkage

Share to Genetic Markers

Share to Genomics

Share to Software

Source

Identifiers

PMID: 15548455
DOI: 10.1016/j.compbiolchem.2004.08.003

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 2 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

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

MEPS parameters and graph analysis for the use of recombination to construct ordered sets of overlapping clones.Semantic proximity Read ↗

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

Linear Time Algorithms to Construct Populations Fitting Multiple Constraint Distributions at Genomic Scales.Semantic proximity Read ↗

A parallel optimization approach for controlling allele diversity in conservation schemes.Semantic proximity Read ↗

An evaluation of the application of the genetic algorithm to the problem of ordering genetic loci on human chromosomes using radiation hybrid data.Semantic proximity Read ↗

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

Maximum likelihood methods in biology revisited with tools of computational intelligence.Semantic proximity Read ↗

A simulated annealing algorithm for maximum likelihood pedigree reconstruction.Semantic proximity Read ↗

Construction of linkage maps in full-sib families of diploid outbreeding species by minimizing the number of recombinations in hidden inheritance vectors.Semantic proximity Read ↗

A genetic model: analysis and application to MAXSAT.Semantic proximity Read ↗

An Analytical Framework for Runtime of a Class of Continuous Evolutionary Algorithms.Semantic proximity Read ↗

Novel hybrid genetic algorithm for progressive multiple sequence alignment.Semantic proximity Read ↗

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