Extending common intervals searching from permutations to sequences
From MaRDI portal
Publication:473211
DOI10.1016/j.jda.2014.10.004zbMath1308.68201arXiv1310.4290OpenAlexW2064365130MaRDI QIDQ473211
Publication date: 24 November 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.4290
Permutations, words, matrices (05A05) Genetics and epigenetics (92D10) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Common intervals of multiple permutations
- New algorithms for text fingerprinting
- Fast algorithms to enumerate all common intervals of two permutations
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
- On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
- Recursive Star-Tree Parallel Data Structure
- Efficiency of a Good But Not Linear Set Union Algorithm
- Combinatorial Pattern Matching
- On the Approximability of Comparing Genomes with Duplicates
- Algorithms – ESA 2005