Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons
From MaRDI portal
Publication:3502633
DOI10.1007/978-3-540-79228-4_5zbMath1139.68418OpenAlexW1563434459MaRDI QIDQ3502633
Publication date: 27 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_5
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10)
This page was built for publication: Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons