Key points are not available for this paper at this time.
DNA sequences are translated into protein coding sequences and then further assigned to protein families in metagenomic analyses, because of the need for sensitivity. However, huge amounts of sequence data create the problem that even general homology search analyses using BLASTX become difficult in terms of computational cost. We designed a new homology search algorithm that finds seed sequences based on the suffix arrays of a query and a database, and have implemented it as GHOSTX. GHOSTX achieved approximately 131-165 times acceleration over a BLASTX search at similar levels of sensitivity. GHOSTX is distributed under the BSD 2-clause license and is available for download at http://www.bi.cs.titech.ac.jp/ghostx/. Currently, sequencing technology continues to improve, and sequencers are increasingly producing larger and larger quantities of data. This explosion of sequence data makes computational analysis with contemporary tools more difficult. We offer this tool as a potential solution to this problem.
Building similarity graph...
Analyzing shared references across papers
Loading...
Shuji Suzuki
Masanori Kakuta
Takashi Ishida
PLoS ONE
Tokyo Institute of Technology
Building similarity graph...
Analyzing shared references across papers
Loading...
Suzuki et al. (Wed,) studied this question.
www.synapsesocial.com/papers/6a12fe3b92637892a9a7a1b4 — DOI: https://doi.org/10.1371/journal.pone.0103833