scientific article; zbMATH DE number 1786460

zbMATH Open0990.68188MaRDI QIDQ4547751FDOQ4547751

Jens Stoye, Steffen Heber

Publication date: 21 August 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2089/20890207

Title of this publication is not available (Why is that?)

Recommendations

• Common intervals of multiple permutations
• \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
• Fast algorithms to enumerate all common intervals of two permutations
• Combinatorial Pattern Matching
• Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Cited In (15)

• Algorithms and Computation
• Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
• Common intervals of trees
• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
• An algorithmic view of gene teams
• Algorithms – ESA 2005
• Fast algorithms to enumerate all common intervals of two permutations
• New algorithms for text fingerprinting
• Common intervals of multiple permutations
• Fast algorithms for identifying maximal common connected sets of interval graphs
• Some families of trees arising in permutation analysis
• Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters
• Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
• Character sets of strings
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547751)