SlideSort
SlideSort identifies similar sequence pairs within a pool of strings using edit distance to accelerate sequence-similarity detection for de novo genome assembly, genome-wide alignment, and short-read summarization.
Key Features:
- Exact Algorithm Design: Finds all similar pairs by exact computation of edit distance within a string pool.
- Efficient Pattern Growth Algorithm: Uses a pattern growth algorithm to identify chains of common k-mers and narrow the search space.
- Performance and Scalability: Outperforms traditional backtracking methods such as BWA (Burrows-Wheeler Aligner) for remote matches and scales to tens of millions of sequences.
- Single Link Clustering Functionality: Provides single link clustering to summarize and group short reads.
Scientific Applications:
- De Novo Genome Assembly: Aids assembly from short reads without a reference by identifying similar reads and overlaps.
- Genome-Wide Alignment: Supports genome-scale alignment and comparison by detecting sequence similarity across large datasets.
- Data Summarization and Processing: Summarizes short-read datasets via clustering to streamline downstream processing.
Methodology:
Identifies chains of common k-mers via a pattern growth algorithm to reduce the number of edit distance calculations required.
Topics
Details
- License:
- Unlicense
- Maturity:
- Mature
- Cost:
- Free of charge
- Tool Type:
- desktop application
- Operating Systems:
- Linux, Windows
- Programming Languages:
- C++
- Added:
- 1/13/2017
- Last Updated:
- 11/24/2024
Operations
Publications
Shimizu K, Tsuda K. SlideSort: all pairs similarity search for short reads. Bioinformatics. 2010;27(4):464-470. doi:10.1093/bioinformatics/btq677. PMID:21148542. PMCID:PMC3035798.
Documentation
Downloads
Links
Repository
https://github.com/iskana/SlideSortIssue tracker
https://github.com/iskana/SlideSort/issues