Sciweavers

    STOC   1995 Annual ACM Symposium on Theory of Computing
    Wall of Fame | Most Viewed STOC-1995 Paper
    STOC
    1995
    ACM
    194views Algorithms» more  STOC 1995»
    Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
    13 years 7 months ago
    Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
    Download  www.cs.tau.ac.il
    Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
    Sridhar Hannenhalli, Pavel A. Pevzner
    claim paper
    Read More »
    Disclaimer and Copyright Notice
    Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
    IdReadViewsTitleStatus
    1Download preprint from source194
    Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
    claim
    2Download preprint from source145
    Polynomial time approximation schemes for dense instances of NP-hard problems
    claim
    3Download preprint from source135
    Subquadratic-time factoring of polynomials over finite fields
    claim
    4Download preprint from source126
    A computational view of population genetics
    claim
    5Download preprint from source118
    On randomized one-round communication complexity
    claim
    6Download preprint from source117
    What's decidable about hybrid automata?
    claim
    7Download preprint from source117
    Lower bounds for sorting networks
    claim
    8Download preprint from source115
    Geometric lower bounds for parametric matroid optimization
    claim
    9Download preprint from source114
    Sorting in linear time?
    claim
    10Download preprint from source114
    On data structures and asymmetric communication complexity
    claim
    11Download preprint from source108
    A parallel repetition theorem
    claim
    12Download preprint from source107
    Incremental cryptography and application to virus protection
    claim
    13Download preprint from source103
    Log-space polynomial end-to-end communication
    claim
    14Download preprint from source98
    Symmetric logspace is closed under complement
    claim
    15Download preprint from source91
    Bandwidth allocation with preemption
    claim
    16Download preprint from source89
    What do we know about the Metropolis algorithm?
    claim
    17Download preprint from source88
    Linear-time encodable and decodable error-correcting codes
    claim
    18Download preprint from source86
    Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract)
    claim
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.