Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
Medientyp
Sprache
Region
Erscheinungszeitraum
Schlagwörter
Zugriff
  • 1
    UID:
    almahu_BV035589292
    Umfang: XIII, 370 S. : , Ill., graph. Darst.
    ISBN: 3-642-02440-8 , 978-3-642-02440-5
    Serie: Lecture notes in computer science 5577
    Anmerkung: Literaturangaben
    Sprache: Englisch
    Schlagwort(e): Konferenzschrift ; Konferenzschrift ; Kongress ; Konferenzschrift
    Mehr zum Autor: Kucherov, Gregory.
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    b3kat_BV035630340
    Umfang: 1 Online-Ressource (XIII, 370 S.) , Ill., graph. Darst.
    ISBN: 9783642024405 , 9783642024412
    Serie: Lecture notes in computer science 5577
    Sprache: Englisch
    Schlagwort(e): Konferenzschrift ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    Mehr zum Autor: Kucherov, Gregory
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    almahu_9947364160202882
    Umfang: XIII, 370 p. , online resource.
    ISBN: 9783642024412
    Serie: Lecture Notes in Computer Science, 5577
    Anmerkung: CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783642024405
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    UID:
    almahu_9949972612002882
    Umfang: XIII, 370 p. , online resource.
    Ausgabe: 1st ed. 2009.
    ISBN: 9783642024412
    Serie: Theoretical Computer Science and General Issues, 5577
    Anmerkung: CPM's 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance "1" Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible HaplotypeData -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783642024405
    Weitere Ausg.: Printed edition: ISBN 9783642024429
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 9783642024450?
Meinten Sie 9783642004407?
Meinten Sie 9783642014475?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz