Abstract We describe an average-case O(n2) algorithm to list all reversals on a signed permutation π that, when applied to π, produce a permutation that is closer to the identity. This algorithm is optimal in the sense that, the time it takes to write the list is Ω(n2) in the worst case.</p
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evo...
Motivated by the problem in computational biology of reconstructing the series of chromosome inversi...
Abstract. This paper investigates the problem of conservation of com-binatorial structures in genome...
Abstract We describe an average-case O(n 2) algorithm to list ...
We give a quadratic algorithm for finding the minimum number of reversals needed to sort a signed pe...
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biolog...
AbstractThe problem of sorting signed permutations by reversals (SBR) is a fundamental problem in co...
The rearrangement distance between single-chromosome genomes can be estimated as the minimum number ...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
A preliminary version of this work appeared in the proceedings of Combinatorial Pattern Matching (CP...
AbstractIn 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding ...
International audienceIn 2008, Braga et al. proposed an algorithm to perform the enumeration of trac...
The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nea...
International audienceTraditional algorithms to solve the problem of sorting by signed reversals out...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evo...
Motivated by the problem in computational biology of reconstructing the series of chromosome inversi...
Abstract. This paper investigates the problem of conservation of com-binatorial structures in genome...
Abstract We describe an average-case O(n 2) algorithm to list ...
We give a quadratic algorithm for finding the minimum number of reversals needed to sort a signed pe...
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biolog...
AbstractThe problem of sorting signed permutations by reversals (SBR) is a fundamental problem in co...
The rearrangement distance between single-chromosome genomes can be estimated as the minimum number ...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
A preliminary version of this work appeared in the proceedings of Combinatorial Pattern Matching (CP...
AbstractIn 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding ...
International audienceIn 2008, Braga et al. proposed an algorithm to perform the enumeration of trac...
The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nea...
International audienceTraditional algorithms to solve the problem of sorting by signed reversals out...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evo...
Motivated by the problem in computational biology of reconstructing the series of chromosome inversi...
Abstract. This paper investigates the problem of conservation of com-binatorial structures in genome...
DOI
Add to ORKG