Physical mapping of chromosomes: A combinatorial problem in molecular biology

No abstract is available for this paper.

• Publication year

  1995

• Venue

  ACM-SIAM Symposium on Discrete Algorithms

• Publication date

  1995-02-01

• Fields of study

  Biology, Mathematics, Computer Science

• Identifiers
  DOI 10.1007/BF01188581
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Assembly and analysis of cosmid contigs in the CEA-gene family region of human chromosome 19.

  1992cited by this paper
• Linear approximation of shortest superstrings

  1991cited by this paper
• Ordering of cosmid clones covering the herpes simplex virus type I (HSV-I) genome: a test case for fingerprinting by hybridisation.

  1990cited by this paper
• Optimizing restriction fragment fingerprinting methods for ordering large genomic libraries.

  1990cited by this paper
• Constructing chromosome- and region-specific cosmid maps of the human genome.

  1989cited by this paper
• Approximation Algorithms for the Shortest Common Superstring Problem

  1989cited by this paper
• Genomic mapping by fingerprinting random clones: a mathematical analysis.

  1988cited by this paper
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

  1973cited by this paper

• A novel parallel framework for scatter search

  2025cites this paper
• A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem

  2022cites this paper
• Heuristic methods to consecutive block minimization

  2020cites this paper
• Solve traveling salesman problem using EMF-CE algorithm

  2020cites this paper
• cloudSPAdes: assembly of synthetic long reads using de Bruijn graphs

  2019cites this paper
• Molekularbiologische Datenbanken

  2019cites this paper
• Multi-dimensional Banded Pattern Mining

  2018cites this paper
• Alternating Hamiltonian cycles in 2-edge-colored multigraphs

  2018cites this paper
• Comparative Analysis of Meta-Heuristic Algorithms for Solving Optimization Problems

  2018cites this paper
• Solving the TSP using Traditional Computing Approach

  2016cites this paper
• Multi-offspring genetic algorithm and its application to the traveling salesman problem

  2016cites this paper
• Banded pattern mining for N-dimensional zero-one data

  2016cites this paper
• A Preliminary Study on Minimum Spanning Tree Algorithm Approach for Travelling Salesman Problem

  2016cites this paper
• Algorithmic aspects of some vertex ordering problems

  2016cites this paper
• Banded Pattern Mining Algorithms in Multi-dimensional Zero-One Data

  2016cites this paper
• Ordering with precedence constraints and budget minimization

  2015cites this paper
• Variants of the Consecutive Ones Property: Algorithms, Computational Complexity and Applications to Genomics

  2015influential citation
• An External-Memory Algorithm for String Graph Construction

  2014cites this paper
• A Novel Approach for Identifying Banded Patterns in Zero-One Data Using Column and Row Banding Scores

  2014cites this paper
• Defining Asymptotic Parallel Time Complexity of Data-dependent Algorithms

  2014cites this paper
• Effective Exponential-Size Integer Programming Models for Bioinformatics Problems

  2014cites this paper
• Finding minimum Tucker submatrices

  2014cites this paper
• A Scalable Algorithm for Banded Pattern Mining in Multi-dimensional Zero-One Data

  2014cites this paper
• Solving TSP Using Various Meta-Heuristic Algorithms

  2013cites this paper
• A Hybrid Mutation-based Artificial Bee Colony for Traveling Salesman Problem

  2013cites this paper
• Variants of the Consecutive Ones property: Algorithms, Complexity and Applications in Genomics

  2013cites this paper
• Minimising the number of gap-zeros in binary matrices

  2013cites this paper
• Complexity Issues in Computational Biology

  2012cites this paper
• Variants of the Consecutive-Ones Property motivated by the reconstruction of ancestral species

  2012cites this paper
• Patterns in permuted binary matrices

  2011cites this paper
• Towards improved Clonal Selection Algorithm by increasing the diversity degree of antibody

  2011cites this paper
• 14 Predicting Parallel TSP Performance : A Computational Approach

  2010cites this paper
• Predicting Parallel TSP Performance: a Computational Approach

  2010cites this paper
• LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes

  2010cites this paper
• Adaptive Genetic Algorithm with Application for Solving Traveling Salesman Problems

  2010influential citation
• Efficient and Accurate Construction of Genetic Linkage Maps from the Minimum Spanning Tree of a Graph

  2008cites this paper
• Mathematical Programming in Computational Biology: an Annotated Bibliography

  2008cites this paper
• Banded structure in binary matrices

  2008cites this paper
• Query support for multi-dimensional and dynamic databases

  2008cites this paper
• Triangular and Trapezoidal Distributions: Applications in the Genome Analysis

  2008cites this paper
• Applying Artificial Intelligence to Predict the Performance of Data-dependent Applications

  2008cites this paper
• TSP Performance Prediction Using Data Mining

  2007cites this paper
• Extracting Knowledge to Predict TSP Asymptotic Time Complexity

  2007cites this paper
• A Computational Approach to TSP Performance Prediction Using Data Mining

  2007cites this paper
• Performance prediction and tuning in a multi-cluster environment

  2006cites this paper
• Statistical Aspects in Physical Mapping Application to the Genome of O. oeni Strain GM

  2005cites this paper
• vLOD: high-fidelity walkthrough of large virtual environments

  2005cites this paper
• Improving EAX with restricted 2-opt

  2005cites this paper
• Partial Digest is hard to solve for erroneous input data

  2005influential citation
• Biologically-Interpretable Disease Classication Based on Gene Expression Data

  2005cites this paper
• Ordering BAC Clones from Fingerprint Data obtained through Four Enzymes Digestion and Fluorescent Labeling

  2004cites this paper
• Some issues of designing genetic algorithms for traveling salesman problems

  2004cites this paper
• An evolutionary algorithm for large traveling salesman problems

  2004cites this paper
• Compressing Large Boolean Matrices using Reordering Techniques

  2004cites this paper
• Noisy Data Make the Partial Digest Problem NP-hard

  2003cites this paper
• A Comparison of Physical Mapping Algorithms Based on the Maximum Likelihood Model

  2003cites this paper
• Clone-array pooled shotgun mapping and sequencing: design and analysis of experiments.

  2003cites this paper
• A Test for the Consecutive Ones Property on Noisy Data—Application to Physical Mapping and Sequence Assembly

  2003cites this paper
• Algorithms and hardness results for DNA physical mapping, protein identification, and related combinatorial problems

  2003cites this paper
• Heterogeneous Selection Genetic Algorithms For Traveling Salesman Problems

  2003cites this paper
• vLOD : A Scalable System for Interactive Walkthroughs of Very Large Virtual Environments

  2003cites this paper
• Compression of Boolean inverted files by document ordering

  2003cites this paper
• Solving traveling salesman problems by combining global and local search mechanisms

  2002cites this paper
• A linear-time algorithm for computing K-terminal reliability on proper interval graphs

  2002cites this paper
• SOME APPLICATIONS OF GRAPH THEORY

  2001cites this paper
• Parallel computation of a maximum-likelihood estimator of a physical map.

  2001cites this paper
• A genetic algorithm for traveling salesman problems

  2001cites this paper
• An algorithm for clustering cDNA fingerprints.

  2000cites this paper
• Contig Selection in Physical Mapping

  2000influential citation
• Application of bootstrap techniques to physical mapping.

  2000cites this paper
• Reconstructing distances in physical maps of chromosomes with nonoverlapping probes

  2000cites this paper
• A Genetic Algorithm for Physical Mapping Problems

  2000cites this paper
• The Complexity of Physical Mapping with Strict Chimerism

  2000cites this paper
• An algorithm for clustering cDNAs for gene expression analysis

  1999cites this paper
• C O M P U T a T I O N a L B I O L O G Y

  1999cites this paper
• Applications of modern heuristic search methods to pattern sequencing problems

  1999cites this paper
• Revealing hidden interval graph structure in STS-content data

  1999cites this paper
• Construction of Physical Maps from Oligonucleotide Fingerprints Data

  1999cites this paper
• Bounded Degree Interval Sandwich Problems

  1999cites this paper
• Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem

  1999cites this paper
• Whole-genome DNA sequencing

  1999cites this paper
• Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut

  1999cites this paper
• A Robust Algorithm for Constructing Physical Maps

  1998cites this paper
• Theory and algorithms for physical mapping of dna

  1998influential citation
• Reconstructing Order and Distance in Physical Maps Using Nonoverlapping Probes

  1998cites this paper
• On clone assembly problems: an error-tolerant test for interval graphs

  1998cites this paper
• Introduction to computational molecular biology

  1997cites this paper
• INFORMATION AND THE CLONE MAPPING OF CHROMOSOMES

  1997cites this paper
• On Constructing Radiation Hybrid Maps

  1997cites this paper
• Comparison of clone-ordering algorithms used in physical mapping.

  1997cites this paper
• A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes

  1997cites this paper
• On constructing radiation hybrid maps (extended abstract)

  1997cites this paper
• On Physical Mapping Algorithms - An Error-Tolerant Test for the Consecutive Ones Property

  1997cites this paper
• Mapping Clones with a Given Ordering or Interleaving

  1997cites this paper
• Beyond islands (extended abstract): runs in clone-probe matrices

  1997cites this paper
• Building Human Genome Maps with Radiation Hybrids

  1997influential citation
• A Short Course in Computational Molecular Biology

  1997cites this paper
• Information and the clone mapping of chromosomes

  1997cites this paper
• FPC: a system for building contigs from restriction fingerprinted clones

  1997cites this paper
• A branch-and-cut approach to physical mapping with end-probes

  1997cites this paper