scientific article; zbMATH DE number 1445327
From MaRDI portal
Publication:4952644
zbMath0963.92012MaRDI QIDQ4952644
George M. Church, Matthew Tepel, John Rush, Ting Chen, Ming-Yang Kao
Publication date: 4 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of mathematical programming (90C90) Dynamic programming (90C39) Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)
Related Items (9)
The restriction mapping problem revisited. ⋮ On the path avoiding forbidden pairs polytope ⋮ The simplified partial digest problem: approximation and a graph-theoretic model ⋮ Almost disjoint paths and separating by forbidden pairs ⋮ Complexity of the path avoiding forbidden pairs problem revisited ⋮ A logic-based approach to polymer sequence analysis ⋮ Improved De Novo Peptide Sequencing using LC Retention Time Information ⋮ Approximately counting approximately-shortest paths in directed acyclic graphs ⋮ Partial digest is hard to solve for erroneous input data
This page was built for publication:
