Mapping clones with a given ordering or interleaving

DOI10.1007/PL00009215MaRDI QIDQ1393069zbMATH OpenFDO

Authors Tao Jiang, Richard Karp

Publication date 1 November 1998

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

computational biologyconstrainted path cover problem

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 437562
• scientific article; zbMATH DE number 1003281
• On the complexity of DNA physical mapping

Cited in

(8)

• scientific article; zbMATH DE number 437562 (Why is no real title available?)
• Probe location in the presence of errors: A problem from DNA mapping
• The complexity of gene placement
• The number of clone orderings
• scientific article; zbMATH DE number 2163026 (Why is no real title available?)
• scientific article; zbMATH DE number 1507244 (Why is no real title available?)
• Island length distribution in genome sequencing.
• scientific article; zbMATH DE number 434723 (Why is no real title available?)

This page was built for publication: Mapping clones with a given ordering or interleaving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1393069)