Combinatorial Pattern Matching: 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999 Proceedings (Lecture Notes in Computer Science) - Taschenbuch

EAN (ISBN-13): 9783540662785
ISBN (ISBN-10): 3540662782
Taschenbuch
Erscheinungsjahr: 1999
Herausgeber: Springer
312 Seiten
Gewicht: 0,474 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-03-02T14:41:14+01:00 (Berlin)
Detailseite zuletzt geändert am 2023-04-05T07:30:29+02:00 (Berlin)
ISBN/EAN: 9783540662785

ISBN - alternative Schreibweisen:
3-540-66278-2, 978-3-540-66278-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: maxime, crochemore, paterson, goos, jones david, mike summer, ted jones
Titel des Buches: warwick, matching patterns, combinatorial pattern matching, who who 1999, the pattern, lecture notes computer science, cpm, ufo symposium

---

Daten vom Verlag:

Autor/in: Maxime Crochemore; Mike Paterson
Titel: Lecture Notes in Computer Science; Combinatorial Pattern Matching - 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999 Proceedings
Verlag: Springer; Springer Berlin
304 Seiten
Erscheinungsjahr: 1999-07-14
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 304 p.

BC; Hardcover, Softcover / Informatik, EDV/Anwendungs-Software; Mustererkennung; Verstehen; Combinatorics; Complexity; DNA/RNA; Matching Algorithms; Pattern Matching; Sequences; data compression; pattern recognition; regular expressions; algorithm analysis and problem complexity; data structures; Automated Pattern Recognition; Programming Techniques; Data Structures and Information Theory; Algorithms; Data Science; Discrete Mathematics in Computer Science; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Informationstheorie; Datenbanken; Mathematik für Informatiker; Diskrete Mathematik; EA

Shift-And Approach to Pattern Matching in LZW Compressed Text.- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text.- Pattern Matching in Text Compressed by Using Antidictionaries.- On the Structure of Syntenic Distance.- Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem.- Hybridization and Genome Rearrangement.- On the Complexity of Positional Sequencing by Hybridization.- GESTALT: Genomic Steiner Alignments.- Bounds on the Number of String Subsequences.- Approximate Periods of Strings.- Finding Maximal Pairs with Bounded Gap.- A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes.- A New Indexing Method for Approximate String Matching.- The Compression of Subsegments of Images Described by Finite Automata.- Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays.- Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions.- Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology.- Fast Multi-dimensional Approximate Pattern Matching.- Finding Common RNA Secondary Structures from RNA Sequences.- Finding Common Subsequences with Arcs and Pseudoknots.- Computing Similarity between RNA Structures.