Search results

Articles (7)

Journals (0)

1-7 of 7 results for Hannenhalli–Pevzner algorithm

Sort by:

Relevance

Select all

Sort by:

Relevance

Retricted access

Research article

First published

Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation

Simon Gog, Martin Bader

Journal of Computational Biology

Retricted access

Research article

First published 2005-07

Chromosomal Breakpoint Reuse in Genome Sequence Rearrangement

David Sankoff, Phil Trinh

Journal of Computational Biology

Retricted access

Research article

First published 2001-10

A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

David A. Bader, Bernard M.E. Moret, Mi Yan

Journal of Computational Biology

Retricted access

Research article

First published 2010-09

Rearrangement Models and Single-Cut Operations

Anne Bergeron, Paul Medvedev, Jens Stoye

Journal of Computational Biology

Retricted access

Research article

First published 2009-10

Hurdles and Sorting by Inversions: Combinatorial,Statistical,and Experimental Results

Krister M. Swenson, Yu Lin, Vaibhav Rajan [...]

Journal of Computational Biology

Retricted access

Research article

First published 2010-03

Sorting Signed Permutations by Inversions in O ( n log n ) Time

Krister M. Swenson, Vaibhav Rajan, Yu Lin [...]

Journal of Computational Biology

Open access

Research article

First published 2021-04

Computing the Rearrangement Distance of Natural Genomes

Leonard Bohnenkämper, Marília D.V. Braga, Daniel Doerr [...]

Journal of Computational Biology