Vertex contraction de novo sequencing

algorithm · Graph / DP

Vertex contraction de novo sequencing: algorithm · Graph / DP. Solves the nested forbidden-pairs longest path problem behind spectrum-graph de novo sequencing in cubic time by vertex contraction.

Solves the nested forbidden-pairs longest path problem behind spectrum-graph de novo sequencing in cubic time by vertex contraction.

Kind	algorithm
Deep learning	no
Family	Graph / DP

Paper describing it

• De Novo Peptide Sequencing Based on Vertex Contraction Algorithm (2012, 2012 Fifth International Joint Conference on Computational Sciences and Optimization, peer-reviewed)

Authors (2)

Zhexue Wei, Daming Zhu

Seen in the charts

• The architectures

Back to the full map