Sign in

Abstract

BackgroundSimilarity search of a given protein sequence against a database is an essential task in genome analysis. Sequence alignment is the most used method to perform such analysis. Although this approach is efficient, the time required to perform searches against large databases is always a challenge. Alignment-free techniques offer alternatives to comparing sequences without the need of alignment.\n\nResultsHere We developed RAFTS3, a fast protein similarity search tool that utilizes a filter step for candidate selection based on shared k-mers and a comparison measure using a binary matrix of co-occurrence of amino acid residues. RAFTS3performed searches many times faster than those with BLASTp against large protein databases, such as NR, Pfam or UniRef, with a small loss of sensitivity depending on the similarity degree of the sequences.\n\nConclusionsRAFTS3 is a new alternative for fast comparison of proteinsequences genome annotation and biological data mining. The source code and the standalone files for Windows and Linux platform are available at: https://sourceforge.net/projects/rafts3/

PDFDOICode

02 /Specification & Classification

Click any tag to browse matching papers

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISNichio '19Procházka '24Korpar '15Slanináková '26Vaser '16Seiler '21
79% semantic matchBioinformatics
Bruno Thiago de Lima Nichio, Aryel Marlus Repula de Oliveira, Camilla Reginatto De Pierri+8 more·BMC Bioinformatics·Jul 15, 2019· 6 citations