Pages that link to "Item:Q2802951"
From MaRDI portal
The following pages link to Linear-Time Sequence Comparison Using Minimal Absent Words & Applications (Q2802951):
Displaying 15 items.
- Alignment free comparison: similarity distribution between the DNA primary sequences based on the shortest absent word (Q285165) (← links)
- An estimator for local analysis of genome based on the minimal absent word (Q306587) (← links)
- Using minimal absent words to build phylogeny (Q442159) (← links)
- Efficient computation of shortest absent words in a genomic sequence (Q765489) (← links)
- A simple, fast, filter-based algorithm for circular sequence comparison (Q1641118) (← links)
- Minimal absent words in a sliding window and applications to on-line pattern matching (Q1679968) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Efficient computation of shortest absent words in complete genomes (Q2195411) (← links)
- Absent words in a sliding window with applications (Q2288209) (← links)
- On overabundant words and their application to biological sequence analysis (Q2326388) (← links)
- (Q4207596) (← links)
- Nearest constrained circular words (Q5140768) (← links)
- Distinct Squares in Circular Words (Q5150916) (← links)
- Circular Sequence Comparison with q-grams (Q5283829) (← links)
- Minimal forbidden factors of circular words (Q5915743) (← links)