General space-efficient sampling algorithm for suboptimal alignment

DOI10.1007/S11741-009-0514-3MaRDI QIDQ3571691zbMATH OpenOpenAlexFDO

Authors Yi Chen, Yanqin 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

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

Recommendations

• On computing all suboptimal alignments
• A Space Efficient Algorithm for Sequence Alignment with Inversions
• A space efficient algorithm for finding the best nonoverlapping alignment score
• A linear-space algorithm for the substring constrained alignment problem
• Approximation algorithms for multiple sequence alignment
• Implementation and Application of Automata
• A space-efficient algorithm for sequence alignment with inversions and reversals
• scientific article; zbMATH DE number 2119727
• The sample complexity of multireference alignment

Cites work

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

Cited in

(5)

• On computing all suboptimal alignments
• A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
• Using Hirschberg's algorithm to generate random alignments of strings
• A Space Efficient Algorithm for Sequence Alignment with Inversions
• A space efficient algorithm for finding the best nonoverlapping alignment score

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3571691)