Multiple genome alignment: chaining algorithms revisited

DOI10.1007/3-540-44888-8_1MaRDI QIDQ3550823zbMATH OpenOpenAlexFDO

Authors Mohamed Ibrahim Abouelhoda, Enno Ohlebusch

Publication date 6 April 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44888-8_1

Mathematics Subject Classification ID

Algorithms on strings (68W32) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20)

Recommendations

• Chaining algorithms for multiple genome comparison
• Publication:4886031
• Linear-space algorithms that build local alignments from fragments
• Implementation and Application of Automata
• Co-linear chaining with overlaps and gap costs

Cited in

(9)

• Linear-space algorithms that build local alignments from fragments
• Co-linear chaining with overlaps and gap costs
• GAME: A simple and efficient whole genome alignment method using maximal exact match filtering
• Chaining algorithms for multiple genome comparison
• Forest alignment with affine gaps and anchors, applied in RNA structure comparison
• scientific article; zbMATH DE number 910858 (Why is no real title available?)
• Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
• Approximation of RNA multiple structural alignment
• Longest common substring with gaps and related problems

This page was built for publication: Multiple genome alignment: chaining algorithms revisited

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