The complexity of gene placement

DOI10.1006/JAGM.2001.1172MaRDI QIDQ2775888zbMATH OpenOpenAlexFDO

Authors Leslie Ann Goldberg, Paul W. Goldberg, Pavel Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk, Mike Paterson

Publication date 8 July 2002

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2001.1172

zbMATH Keywords

gene placement

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1305428
• Algorithms for Finding Gene Clusters
• Mapping clones with a given ordering or interleaving
• scientific article; zbMATH DE number 437562
• On Recovering Syntenic Blocks from Comparative Maps

Cited in

(7)

• Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results
• An algorithmic view on multi-related-segments: a unifying model for approximate common interval
• Revisiting the minimum breakpoint linearization problem
• Revisiting the minimum breakpoint linearization problem
• The interval ordering problem
• scientific article; zbMATH DE number 1305428 (Why is no real title available?)
• Localization of genes

This page was built for publication: The complexity of gene placement

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