The following pages link to (Q4547751):
Displaying 10 items.
- 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)
- Some families of trees arising in permutation analysis (Q2185210) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- Character sets of strings (Q2457304) (← links)
- Fast algorithms for identifying maximal common connected sets of interval graphs (Q2499592) (← links)
- Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters (Q3004680) (← links)
