General space-efficient sampling algorithm for suboptimal alignment

DOI10.1007/s11741-009-0514-3zbMath1212.90398OpenAlexW1543242080MaRDI QIDQ3571691

Yi Chen, Yan-Qin Bai

Publication date: 8 July 2010

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-009-0514-3

zbMATH Keywords

dynamic programmingsuboptimal alignmentbiological sequence comparison

Mathematics Subject Classification ID

Dynamic programming (90C39) Protein sequences, DNA sequences (92D20)

Cites Work

• A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
• On computing all suboptimal alignments
• A New Dynamic Programming Algorithm for Multiple Sequence Alignment
• Biological Sequence Analysis

This page was built for publication: General space-efficient sampling algorithm for suboptimal alignment