scientific article; zbMATH DE number 1786460
From MaRDI portal
Publication:4547751
zbMath0990.68188MaRDI QIDQ4547751
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2089/20890207
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)
Related Items
Common intervals of trees ⋮ An algorithmic view of gene teams ⋮ Some families of trees arising in permutation analysis ⋮ Character sets of strings ⋮ New algorithms for text fingerprinting ⋮ Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters ⋮ Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings ⋮ An algorithm for deciding the finiteness of the number of simple permutations in permutation classes ⋮ Common intervals of multiple permutations ⋮ Fast algorithms for identifying maximal common connected sets of interval graphs
