X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Combinatorial Pattern Matching : 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004. Proceedings (2004)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920528002882
    Format: XII, 492 p. , online resource.
    ISBN: 9783540278016
    Series Statement: Lecture Notes in Computer Science, 3109
    Note: 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
    Additional Edition: Printed edition: ISBN 9783540223412
    Language: English
    DOI: 10.1007/b98377
    URL: http://dx.doi.org/10.1007/b98377
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 2
    Online Resource
    Online Resource
    Combinatorial Pattern Matching : 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings (2004)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621280702882
    Format: XII, 492 p. , online resource.
    Edition: 1st ed. 2004.
    ISBN: 9783540278016
    Series Statement: Lecture Notes in Computer Science, 3109
    Note: 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
    Additional Edition: Printed edition: ISBN 9783540223412
    Additional Edition: Printed edition: ISBN 9783662202333
    Language: English
    DOI: 10.1007/b98377
    URL: https://doi.org/10.1007/b98377
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 3
    Online Resource
    Online Resource
    Combinatorial Pattern Matching : 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004. Proceedings (2004)
    Berlin : Springer
    Details
    UID:
    gbv_749094362
    Format: Online-Ressource (XI, 486 p. Also available online) , digital
    Edition: Springer eBook Collection. Computer Science
    ISBN: 9783540278016 , 354022341X , 9783540223412
    Series Statement: Lecture Notes in Computer Science 3109
    Content: 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
    Note: Literaturangaben
    Additional Edition: ISBN 9783540223412
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540223412
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662202333
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Mustervergleich ; Konferenzschrift
    DOI: 10.1007/b98377
    URL: lizenzpflichtig
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 9783540078036?
Did you mean 9783540228011?
Did you mean 9783540078616?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages