Peptide sequencing via graph path decomposition

DOI10.1016/j.ins.2015.01.003zbMath1360.92045OpenAlexW1995143145MaRDI QIDQ528747

Yinglei Song, Albert Y. Chi

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.01.003

zbMATH Keywords

dynamic programminggraph path decompositionpeptide sequencing

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
• On finding the longest antisymmetric path in directed acyclic graphs
• Safe separators for treewidth
• Parameterized dominating set problem in chordal graphs: Complexity and lower bound
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Impossible pair constrained test path generation in a program
• Graph minors. II. Algorithmic aspects of tree-width

This page was built for publication: Peptide sequencing via graph path decomposition