GAME: A simple and efficient whole genome alignment method using maximal exact match filtering

DOI10.1016/j.compbiolchem.2005.04.004zbMath1102.92015OpenAlexW2032610035WikidataQ51970643 ScholiaQ51970643MaRDI QIDQ2500318

Yanyan Li

Publication date: 23 August 2006

Published in: Computational Biology and Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compbiolchem.2005.04.004

zbMATH Keywords

Anchor filteringMaximal exact matchWhole genome alignment

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Uses Software

• DIALIGN
• LAGAN
• BLAT
• AVID
• MUMMER
• PipMaker
• SSAHA
• PatternHunter
• BLASTZ

Cites Work

• Unnamed Item
• Faster suffix sorting
• Suffix Arrays: A New Method for On-Line String Searches

This page was built for publication: GAME: A simple and efficient whole genome alignment method using maximal exact match filtering