Pages that link to "Item:Q1969959"
From MaRDI portal
The following pages link to Fast algorithms to enumerate all common intervals of two permutations (Q1969959):
Displaying 18 items.
- New applications of interval generators to genome comparison (Q414431) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Extending common intervals searching from permutations to sequences (Q473211) (← links)
- Common intervals of multiple permutations (Q534763) (← links)
- An algorithmic view of gene teams (Q596107) (← links)
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497) (← links)
- Common intervals of trees (Q834996) (← links)
- New algorithms for text fingerprinting (Q935841) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints (Q1784981) (← links)
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations (Q2250447) (← links)
- Character sets of strings (Q2457304) (← links)
- Competitive graph searches (Q2481952) (← links)
- Fast algorithms for identifying maximal common connected sets of interval graphs (Q2499592) (← links)
- AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS (Q2890993) (← links)
- Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters (Q3004680) (← links)
- Approximate search for known gene clusters in new genomes using PQ-trees (Q6487618) (← links)
