An algorithm for computing the restriction s|caffold assignment problem in computational biology

DOI10.1016/j.ipl.2005.05.007zbMath1182.68354OpenAlexW2098661994MaRDI QIDQ1041813

Justin Colannino, Godfried T. Toussaint

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.007

zbMATH Keywords

assignment problemsinformation retrievalanalysis of algorithmscomputational geometrycomputational biologyoperations researchrhythmic similarity measures

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computational methods for problems pertaining to biology (92-08)

Related Items (4)

Efficient many-to-Many point matching in one dimension ⋮ An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension ⋮ Simple linear flow decomposition algorithms on trees, circles, and augmented trees ⋮ Computational geometric aspects of rhythm, melody, and voice-leading

Cites Work

• Two special cases of the assignment problem
• Distance measures for point sets and their computation
• Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
• Unnamed Item

This page was built for publication: An algorithm for computing the restriction s|caffold assignment problem in computational biology