z-logo
open-access-imgOpen Access
Faster sequence homology searches by clustering subsequences
Author(s) -
Shuji Suzuki,
Masanori Kakuta,
Takashi Ishida,
Yutaka Akiyama
Publication year - 2014
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/btu780
Subject(s) - cluster analysis , homology (biology) , sequence (biology) , sequence homology , computer science , computational biology , sequence alignment , base sequence , genetics , biology , artificial intelligence , peptide sequence , gene
Sequence homology searches are used in various fields. New sequencing technologies produce huge amounts of sequence data, which continuously increase the size of sequence databases. As a result, homology searches require large amounts of computational time, especially for metagenomic analysis.

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom