Perfect Hamming code with a hash table for faster genome mapping

10th Int. Conference on Bioinformatics - 1st ISCB Asia Joint Conference 2011, InCoB 2011/ISCB-Asia 2011: Computational Biology - Proceedings from Asia Pacific Bioinformatics Network (APBioNet)

Volumn 12, Issue SUPPL. 3, 2011, Pages

  Takenaka, Yoichi ^a   Seno, Shigeto ^a   Matsuda, Hideo ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ACCELERATION TECHNIQUE; CODE-WORDS; COMPUTATION TIME; FAST ALGORITHMS; GALOIS EXTENSION; GENOME MAPPING; GROWING DEMAND; HAMMING CODE; HASH TABLE; KEY TECHNOLOGIES; LIMITED CAPACITY; SUFFIX ARRAYS;

ALGORITHMS; BIOINFORMATICS; DNA; DNA SEQUENCES; EQUIVALENCE CLASSES; IMAGE MATCHING; MAPPING;

GENE ENCODING;

ALGORITHM; ARTICLE; CHROMOSOME MAP; DNA SEQUENCE; METHODOLOGY; NUCLEOTIDE SEQUENCE; SEARCH ENGINE;

ALGORITHMS; BASE SEQUENCE; CHROMOSOME MAPPING; SEARCH ENGINE; SEQUENCE ANALYSIS, DNA;

EID: 84862258282     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1186/1471-2164-12-S3-S8     Document Type: Conference Paper

References (14)

1. Pearson WR, Lipman DJ: Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. USA 1988, 85:2444-2448.
2. Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool. J. Mol. Biol 1990, 215:403-10.
3. Burrows M, Wheeler DJ: A block-sorting lossless data compression algorithm. Palo Alto, CA, Digital Equipment Corporation 1994, Technical report 124.
4. Li H, Durbin R: Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Research 2008, 18(11):1851-1858.
5. Li R, Kristiansen K, Wang J: SOAP: short oligonucleotide alignment program. Bioinformatics 2008, 24(5):713-714.
6. Hach F, Hormozdiari F, Alkan C, Hormozdiari F, Birol I, Eichler EE, Sahinalp SC: mrsFAST: a cache-oblivious algorithm for short-read mapping. Nature Methods 2010, 7:576-577.
7. Abouelhoda MI, Kurtz S, Ohlebusch E: The enhanced suffix array and its applications to genome analysis. Lecture Note in Computer Science 2002, 2542:449-463.
8. Langmead B, Trapnell C, Pop M, Salzberg SL: Ultrafast and memoryefficient alignment of short DNA sequences to the human genome. Genome Biology 2009, 10(3):R25.
9. Li H, Durbin R: Fast and accurate short read alignment with Burrows- Wheeler transform. Bioinformatics 2009, 25(14):1754-1760.
10. Li R, Yu C, Li Y, Lam TW, Yiu SM, Kristiansen K, Wang J: SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics 2009, 25(15):1966-1967.
11. Hoffmann S, Otto C, Kurtz S, Sharma CM, Khaitovich P, Vogel J, Stadler PF, Hackermüller J: Fast mapping of short sequences with mismatches, insertions and deletions using index structures. PLoS Comput Biol 2009, 5(11):e1000502.
12. Encycropedic Dictionary of Mathematics, second edition. First MIT Press; Ito K, second 1996:.
13. Takenaka Y, Matsuda H: Frequency enmeration of DNA subsequences from large-scale sequences using linear code. Proceeding of 11th Intl. conf. ISMB 2003, B-59.
14. Takenaka Y, Sakata M, Matsuda H: Nucleotide encoding according to perfect linear code and its application to mutiple alignment. Information Processing Society of Japan, Special Interest Groups Technical Report 2006, BIO-5:103-109.