X

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
  • 1
    Buch
    Buch
    Combinatorial pattern matching : 15th annual Symposium, CPM 2004, Istanbul, Turkey, July 5 - 7, 2004 ; proceedings (2004)
    Berlin [u.a.] :Springer,
    Dazugehörige Titel
    Details
    UID:
    almafu_BV019351955
    Umfang: XI, 486 S. : , Ill., graph. Darst.
    ISBN: 3-540-22341-X
    Serie: Lecture notes in computer science 3109
    Sprache: Englisch
    Schlagwort(e): Mustervergleich ; Konferenzschrift ; Konferenzschrift ; Kongress ; Konferenzschrift ; Konferenzschrift
    URL: Inhaltsverzeichnis
    URL: Cover
    URL: Inhaltstext
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Buch
    HU Berlin get availability status
    FU Berlin get availability status
    UB Potsdam get availability status
    Berlin VÖBB/ZLB get availability status
  • 2
    Online-Ressource
    Online-Ressource
    Combinatorial Pattern Matching : 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004. Proceedings (2004)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Dazugehörige Titel
    Details
    UID:
    almahu_9947920528002882
    Umfang: XII, 492 p. , online resource.
    ISBN: 9783540278016
    Serie: Lecture Notes in Computer Science, 3109
    Anmerkung: Sorting by Reversals in Subquadratic Time -- Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs -- Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity -- Optimizing Multiple Spaced Seeds for Homology Search -- Approximate Labelled Subtree Homeomorphism -- On the Average Sequence Complexity -- Approximate Point Set Pattern Matching on Sequences and Planes -- Finding Biclusters by Random Projections -- Real-Time String Matching in Sublinear Space -- On the k-Closest Substring and k-Consensus Pattern Problems -- A Trie-Based Approach for Compacting Automata -- A Simple Optimal Representation for Balanced Parentheses -- Two Algorithms for LCS Consecutive Suffix Alignment -- Efficient Algorithms for Finding Submasses in Weighted Strings -- Maximum Agreement and Compatible Supertrees -- Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem -- Small Phylogeny Problem: Character Evolution Trees -- The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices -- A Computational Model for RNA Multiple Structural Alignment -- Computational Design of New and Recombinant Selenoproteins -- A Combinatorial Shape Matching Algorithm for Rigid Protein Docking -- Multi-seed Lossless Filtration -- New Results for the 2-Interval Pattern Problem -- A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes -- Sparse Normalized Local Alignment -- Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences -- Maximal Common Connected Sets of Interval Graphs -- Performing Local Similarity Searches with Variable Length Seeds -- Reversal Distance without Hurdles and Fortresses -- A Fast Set Intersection Algorithm for Sorted Sequences -- Faster Two Dimensional Pattern Matching with Rotations -- Compressed Compact Suffix Arrays -- Approximate String Matching Using Compressed Suffix Arrays -- Compressed Index for a Dynamic Collection of Texts -- Improved Single and Multiple Approximate String Matching -- Average-Case Analysis of Approximate Trie Search.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540223412
    Sprache: Englisch
    DOI: 10.1007/b98377
    URL: http://dx.doi.org/10.1007/b98377
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    HU Berlin
  • 3
    Online-Ressource
    Online-Ressource
    Combinatorial Pattern Matching : 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004. Proceedings (2004)
    Berlin : Springer
    Details
    UID:
    gbv_749094362
    Umfang: Online-Ressource (XI, 486 p. Also available online) , digital
    Ausgabe: Reproduktion Springer eBook Collection. Computer Science
    ISBN: 9783540278016 , 354022341X , 9783540223412
    Serie: Lecture Notes in Computer Science 3109
    Inhalt: This book constitutes the refereed proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004, held in Istanbul, Turkey in July 2004. The 36 revised full papers presented were carefully reviewed and selected from 79 submissions. The papers are devoted to current theoretical and computational aspects of searching and matching of strings and more complicate patterns, such as trees, regular expressions, graphs, point sets, and arrays. Among the application fields addressed are computational biology, bioinformatics, genomics, proteinomics, the web, data compression, coding, multimedia, information retrieval, data analysis, pattern recognition, and computer vision
    Anmerkung: Literaturangaben
    Weitere Ausg.: ISBN 9783540223412
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 9783540223412
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 9783662202333
    Sprache: Englisch
    Schlagwort(e): Mustervergleich ; Konferenzschrift
    DOI: 10.1007/b98377
    URL: lizenzpflichtig
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext
    URL: Inhaltstext
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Online Zugang
    Open Access Wunsch
    UB Potsdam
  • 4
    Online-Ressource
    Online-Ressource
    Combinatorial Pattern Matching : 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings (2004)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Dazugehörige Titel
    Details
    UID:
    almahu_9948621280702882
    Umfang: XII, 492 p. , online resource.
    Ausgabe: 1st ed. 2004.
    ISBN: 9783540278016
    Serie: Lecture Notes in Computer Science, 3109
    Anmerkung: Sorting by Reversals in Subquadratic Time -- Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs -- Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity -- Optimizing Multiple Spaced Seeds for Homology Search -- Approximate Labelled Subtree Homeomorphism -- On the Average Sequence Complexity -- Approximate Point Set Pattern Matching on Sequences and Planes -- Finding Biclusters by Random Projections -- Real-Time String Matching in Sublinear Space -- On the k-Closest Substring and k-Consensus Pattern Problems -- A Trie-Based Approach for Compacting Automata -- A Simple Optimal Representation for Balanced Parentheses -- Two Algorithms for LCS Consecutive Suffix Alignment -- Efficient Algorithms for Finding Submasses in Weighted Strings -- Maximum Agreement and Compatible Supertrees -- Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem -- Small Phylogeny Problem: Character Evolution Trees -- The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices -- A Computational Model for RNA Multiple Structural Alignment -- Computational Design of New and Recombinant Selenoproteins -- A Combinatorial Shape Matching Algorithm for Rigid Protein Docking -- Multi-seed Lossless Filtration -- New Results for the 2-Interval Pattern Problem -- A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes -- Sparse Normalized Local Alignment -- Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences -- Maximal Common Connected Sets of Interval Graphs -- Performing Local Similarity Searches with Variable Length Seeds -- Reversal Distance without Hurdles and Fortresses -- A Fast Set Intersection Algorithm for Sorted Sequences -- Faster Two Dimensional Pattern Matching with Rotations -- Compressed Compact Suffix Arrays -- Approximate String Matching Using Compressed Suffix Arrays -- Compressed Index for a Dynamic Collection of Texts -- Improved Single and Multiple Approximate String Matching -- Average-Case Analysis of Approximate Trie Search.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783540223412
    Weitere Ausg.: Printed edition: ISBN 9783662202333
    Sprache: Englisch
    DOI: 10.1007/b98377
    URL: https://doi.org/10.1007/b98377
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    HU Berlin
Nichts oder nicht das Richtige gefunden? Für eine Suche/Fernleihbestellung aus dem Ausland nutzen Sie das Suche-Set "KOBV-International" im alten KOBV-Portal.
Meinten Sie 9783540083412?
Meinten Sie 9783540203612?
Meinten Sie 9783540221142?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz