New applications of interval generators to genome comparison

DOI10.1016/j.jda.2011.11.002zbMath1236.92023OpenAlexW2000949547MaRDI QIDQ414431

Irena Rusu

Publication date: 11 May 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.11.002

zbMATH Keywords

permutationsalgorithmscommon intervalsconserved intervals

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04) Algorithms on strings (68W32)

Related Items (1)

\textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations

Uses Software

• CREx

Cites Work

• Unnamed Item
• Fast algorithms to enumerate all common intervals of two permutations
• Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
• On the Approximability of Comparing Genomes with Duplicates
• Combinatorial Pattern Matching

This page was built for publication: New applications of interval generators to genome comparison