The following pages link to Combinatorial Pattern Matching (Q5315343):
Displaying 15 items.
- New applications of interval generators to genome comparison (Q414431) (← links)
- Extending common intervals searching from permutations to sequences (Q473211) (← links)
- Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
- An algorithmic view of gene teams (Q596107) (← links)
- Common intervals of trees (Q834996) (← links)
- Comparing bacterial genomes from linear orders of patterns (Q947065) (← links)
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations (Q2250447) (← links)
- Improved approximate common interval (Q2379959) (← links)
- Character sets of strings (Q2457304) (← links)
- Fast algorithms for identifying maximal common connected sets of interval graphs (Q2499592) (← links)
- An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval (Q2898043) (← links)
- Gene clusters as intersections of powers of paths (Q2918486) (← links)
- The Potential of Family-Free Genome Comparison (Q4992763) (← links)
- Combinatorial Pattern Matching (Q5713535) (← links)
- Approximate search for known gene clusters in new genomes using PQ-trees (Q6487618) (← links)
