Pages that link to "Item:Q1784946"
From MaRDI portal
The following pages link to Alignment-free sequence comparison using absent words (Q1784946):
Displaying 26 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)
- Minimal absent words in a sliding window and applications to on-line pattern matching (Q1679968) (← links)
- Constructing antidictionaries of long texts in output-sensitive space (Q2048208) (← links)
- Combinatorics of minimal absent words for a sliding window (Q2163388) (← 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)
- Extraction of high quality \(k\)-words for alignment-free sequence comparison (Q2415644) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications (Q2802951) (← links)
- Comparison of Symbol Sequences: No Editing, No Alignment (Q4539506) (← links)
- Reverse-Safe Text Indexing (Q5102053) (← links)
- Some Investigations on Similarity Measures Based on Absent Words (Q5114210) (← links)
- Circular Sequence Comparison with q-grams (Q5283829) (← links)
- Alignment-free sequence comparison with spaced k-mers. (Q5398390) (← links)
- Minimal forbidden factors of circular words (Q5915743) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
- Minimal absent words in rooted and unrooted trees (Q6536250) (← links)
- Linear-time computation of generalized minimal absent words for multiple strings (Q6545442) (← links)
- Isometric words and edit distance: main notions and new variations (Q6546059) (← links)
- Density of \(k\)-ary words with 0, 1, 2-error overlaps (Q6652469) (← links)