Recently 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 was first presented at the Symposium on Complexity of Computer Computations, IBM Thomas J...
Peter H. Sellers. On the theory and computation of evolutionary distances. SIAM J. Appl. Math., 197...
There are many popular problems in different practical fields of computer sciences, computer network...
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 ...
Bergeron A, Heber S, Stoye J. Common intervals and sorting by reversals: a marriage of necessity. Bi...
An algorithm for generating permutation distribution of ranks in a k-sample experiment is presented....
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...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
Summary. We analyse three algorithms: exponentiation by squaring, cal-culation of maximum, and sorti...
This paper revisits the problem of sorting by reversals with tools developed in the context of detec...
The purpose of the article is to analyze the known methods of ordering in computer science. The res...
This article reviews objections to optimal-matching (OM) algorithms in sequence analysis and reformu...
AbstractIn this paper a new general approach for the so-called “zero-one principle” for sorting algo...
This paper was first presented at the Symposium on Complexity of Computer Computations, IBM Thomas J...
Peter H. Sellers. On the theory and computation of evolutionary distances. SIAM J. Appl. Math., 197...
There are many popular problems in different practical fields of computer sciences, computer network...
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 ...
Bergeron A, Heber S, Stoye J. Common intervals and sorting by reversals: a marriage of necessity. Bi...
An algorithm for generating permutation distribution of ranks in a k-sample experiment is presented....
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...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
Summary. We analyse three algorithms: exponentiation by squaring, cal-culation of maximum, and sorti...
This paper revisits the problem of sorting by reversals with tools developed in the context of detec...
The purpose of the article is to analyze the known methods of ordering in computer science. The res...
This article reviews objections to optimal-matching (OM) algorithms in sequence analysis and reformu...
AbstractIn this paper a new general approach for the so-called “zero-one principle” for sorting algo...
This paper was first presented at the Symposium on Complexity of Computer Computations, IBM Thomas J...
Peter H. Sellers. On the theory and computation of evolutionary distances. SIAM J. Appl. Math., 197...
There are many popular problems in different practical fields of computer sciences, computer network...
DOI
Add to ORKG