Optimal pathway reconstruction on 3D NMR maps

DOI10.1016/j.dam.2014.04.010zbMath1306.05075DBLPjournals/dam/SzachniukCFWB15OpenAlexW2041294920WikidataQ57387703 ScholiaQ57387703MaRDI QIDQ2255053

Dominique de Werra, Marta Szachniuk, Giovanni Felici, Maria Cristina De Cola, Jacek Błażewicz

Publication date: 6 February 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.04.010

zbMATH Keywords

integer programmingNMR assignmentorderly colored longest path

Mathematics Subject Classification ID

Applications of graph theory (05C90) Paths and cycles (05C38) Biochemistry, molecular biology (92C40) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Exact approaches for the orderly colored longest path problem: performance comparison ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ Two heuristics for the rainbow spanning forest problem ⋮ New models and algorithms for RNA pseudoknot order assignment ⋮ The rainbow spanning forest problem ⋮ On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs

Uses Software

• MCQ4Structures
• BioMagResBank

Cites Work

• MCQ4Structures to compute similarity of molecule structures
• A note on alternating cycles in edge-coloured graphs
• Properly coloured Hamiltonian paths in edge-coloured complete graphs
• Note on alternating directed cycles
• Paths and trails in edge-colored graphs
• Long Alternating Cycles in Edge-Colored Complete Graphs
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal pathway reconstruction on 3D NMR maps