SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size | Zendy

Eldar Giladi | Zendy; Michael G. Walker | Zendy; James Z. Wang | Zendy; Wayne Volkmuth | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size

Author(s) -

Eldar Giladi,

Michael G. Walker,

James Z. Wang,

Wayne Volkmuth

Publication year - 2002

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/18.6.873

Subject(s) - algorithm , nearest neighbor search , computer science , sequence database , logarithm , sequence (biology) , tree (set theory) , search engine indexing , tuple , mathematics , data mining , artificial intelligence , combinatorics , discrete mathematics , mathematical analysis , biochemistry , chemistry , genetics , biology , gene

Searches for near exact sequence matches are performed frequently in large-scale sequencing projects and in comparative genomics. The time and cost of performing these large-scale sequence-similarity searches is prohibitive using even the fastest of the extant algorithms. Faster algorithms are desired.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research