Speeding up whole-genome alignment by indexing frequency vectors
Author(s) -
Tamer Kahveci,
Vebjorn Ljosa,
Ambuj K. Singh
Publication year - 2004
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/bth212
Subject(s) - substring , computer science , search engine indexing , hash function , string (physics) , hash table , genome , visualization , string searching algorithm , approximate string matching , data structure , data mining , theoretical computer science , information retrieval , artificial intelligence , pattern matching , mathematics , biology , biochemistry , computer security , gene , mathematical physics , programming language
Many biological applications require the comparison of large genome strings. Current techniques suffer from high computational and I/O costs.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom