Multiple genome alignment: chaining algorithms revisited

DOI10.1007/3-540-44888-8_1zbMATH Open1279.92062OpenAlexW1779369758MaRDI QIDQ3550823FDOQ3550823

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Forest alignment with affine gaps and anchors, applied in RNA structure comparison
• Approximation of RNA multiple structural alignment
• Title not available (Why is that?)
• Linear-space algorithms that build local alignments from fragments
• Chaining algorithms for multiple genome comparison
• Co-linear chaining with overlaps and gap costs
• GAME: A simple and efficient whole genome alignment method using maximal exact match filtering
• Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended

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)