Computing and Combinatorics

DOI10.1007/11533719zbMath1128.92316OpenAlexW4376561447MaRDI QIDQ5716968

Romeo Rizzi, Guillaume Blin

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719

zbMATH Keywords

MatchingComputational complexityConserved interval distanceDuplicated genesExemplar stringLongest Common Substring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Genetics and epigenetics (92D10)

Related Items (5)

On the approximability of the exemplar adjacency number problem for genomes with gene repetitions ⋮ On the inapproximability of the exemplar conserved interval distance problem of genomes ⋮ On the Approximability of Comparing Genomes with Duplicates ⋮ \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics

This page was built for publication: Computing and Combinatorics