On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
From MaRDI portal
Publication:3082914
DOI10.1007/3-540-45071-8_9zbMath1236.92020OpenAlexW2135504563MaRDI QIDQ3082914
Publication date: 18 March 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://pub.uni-bielefeld.de/record/1970477
Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10)
Related Items (9)
Common intervals of trees ⋮ HP Distance Via Double Cut and Join Distance ⋮ On the inapproximability of the exemplar conserved interval distance problem of genomes ⋮ Extending common intervals searching from permutations to sequences ⋮ Common intervals of multiple permutations ⋮ Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints ⋮ A new linear time algorithm to compute the genomic distance via the double cut and join distance ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics ⋮ Error Detection and Correction of Gene Trees
This page was built for publication: On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
