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 7 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)
- Approximate search for known gene clusters in new genomes using PQ-trees (Q6487618) (← links)
