Tree-decomposition de novo sequencing

algorithm · Graph / DP

Tree-decomposition de novo sequencing: algorithm · Graph / DP. Models relationships among peaks as a graph and uses tree decomposition to find the longest antisymmetric path, giving linear-time de novo sequencing and quadratic-time…

Models relationships among peaks as a graph and uses tree decomposition to find the longest antisymmetric path, giving linear-time de novo sequencing and quadratic-time spectral alignment that tolerate noise and PTMs.

Kind	algorithm
Deep learning	no
Acquisition	DDA
Family	Graph / DP

Paper describing it

• FAST DE NOVO PEPTIDE SEQUENCING AND SPECTRAL ALIGNMENT VIA TREE DECOMPOSITION (2005, Biocomputing 2006, peer-reviewed)

Authors (5)

Chunmei Liu, Yinglei Song, Bo Yan, Ying Xu, LIMING CAI

Seen in the charts

• The architectures
• Models and the authors behind them

Back to the full map