AbstractRecently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre Andersen's so-called Principle of Equivalence in mathematical statistics. In the present paper such algorithms are discussed systematically
This paper revisits the problem of sorting by reversals with tools developed in the context of detec...
AbstractIn this paper a new general approach for the so-called “zero-one principle” for sorting algo...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...
Recently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre Andersen...
AbstractRecently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre ...
An algorithm for generating permutation distribution of ranks in a k-sample experiment is presented....
Bergeron A, Heber S, Stoye J. Common intervals and sorting by reversals: a marriage of necessity. Bi...
Summary. We analyse three algorithms: exponentiation by squaring, cal-culation of maximum, and sorti...
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evo...
The problem of biological sequence comparison arises naturally in an attempt to explain many biologi...
There are many popular problems in different practical fields of computer sciences, computer network...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
The purpose of the article is to analyze the known methods of ordering in computer science. The res...
Peter H. Sellers. On the theory and computation of evolutionary distances. SIAM J. Appl. Math., 197...
This paper was first presented at the Symposium on Complexity of Computer Computations, IBM Thomas J...
This paper revisits the problem of sorting by reversals with tools developed in the context of detec...
AbstractIn this paper a new general approach for the so-called “zero-one principle” for sorting algo...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...
Recently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre Andersen...
AbstractRecently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre ...
An algorithm for generating permutation distribution of ranks in a k-sample experiment is presented....
Bergeron A, Heber S, Stoye J. Common intervals and sorting by reversals: a marriage of necessity. Bi...
Summary. We analyse three algorithms: exponentiation by squaring, cal-culation of maximum, and sorti...
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evo...
The problem of biological sequence comparison arises naturally in an attempt to explain many biologi...
There are many popular problems in different practical fields of computer sciences, computer network...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
The purpose of the article is to analyze the known methods of ordering in computer science. The res...
Peter H. Sellers. On the theory and computation of evolutionary distances. SIAM J. Appl. Math., 197...
This paper was first presented at the Symposium on Complexity of Computer Computations, IBM Thomas J...
This paper revisits the problem of sorting by reversals with tools developed in the context of detec...
AbstractIn this paper a new general approach for the so-called “zero-one principle” for sorting algo...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...
DOI
Add to ORKG