Algorithms to compute the Burrows-Wheeler Similarity Distribution
- 1 August 2019
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 782, 145-156
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- FAPESP (#2017/09105-0, #2018/21509-2)
- CNPq (425340/2016-3, 310685/2015-0)
- FAPESP (#2015/50122-0)
- CNPq (303012/2015-3)
This publication has 15 references indexed in Scilit:
- A Framework for Space-Efficient String KernelsAlgorithmica, 2017
- Fast construction of wavelet treesTheoretical Computer Science, 2016
- Practical linear-time O (1)-workspace suffix sorting for constant alphabetsACM Transactions on Information Systems, 2013
- Improved Similarity Trees and their Application to Visual Data ClassificationIEEE Transactions on Visualization and Computer Graphics, 2011
- Use of the Burrows–Wheeler similarity distribution to the comparison of the proteinsAmino Acids, 2010
- The Burrows–Wheeler similarity distribution between biological sequences based on Burrows–Wheeler transformJournal of Theoretical Biology, 2010
- A New Combinatorial Approach to Sequence ComparisonTheory of Computing Systems, 2007
- Compressed full-text indexesACM Computing Surveys, 2007
- Indexing compressed textJournal of the ACM, 2005
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993