Bild 1 von 1
Galerie
Bild 1 von 1
Ähnlichen Artikel verkaufen?
Kombinatorisch
US $67,47
Ca.CHF 54,48
Artikelzustand:
Neu
Neues, ungelesenes, ungebrauchtes Buch in makellosem Zustand ohne fehlende oder beschädigte Seiten. Genauere Einzelheiten entnehmen Sie bitte dem Angebot des Verkäufers.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
Kostenlos Economy Shipping.
Standort: Fairfield, Ohio, USA
Lieferung:
Lieferung zwischen Fr, 5. Sep und Di, 16. Sep nach 94104 bei heutigem Zahlungseingang
Rücknahme:
30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
Sicher einkaufen
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:395149775030
Artikelmerkmale
- Artikelzustand
- ISBN-13
- 9783540662785
- Book Title
- Combinatorial Pattern Matching
- ISBN
- 9783540662785
Über dieses Produkt
Product Identifiers
Publisher
Springer Berlin / Heidelberg
ISBN-10
3540662782
ISBN-13
9783540662785
eBay Product ID (ePID)
127438933
Product Key Features
Number of Pages
VIII, 304 Pages
Language
English
Publication Name
Combinatorial Pattern Matching : 10th Annual Symposium, CPM 99 Warwick University, UK, July 1999, Proceedings
Publication Year
1999
Subject
Programming / General, Programming / Algorithms, Combinatorics, Databases / General, Computer Vision & Pattern Recognition
Type
Textbook
Subject Area
Mathematics, Computers
Series
Lecture Notes in Computer Science Ser.
Format
Trade Paperback
Dimensions
Item Weight
34.2 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
Series Volume Number
1645
Number of Volumes
1 vol.
Illustrated
Yes
Table Of Content
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.
Synopsis
The papers contained in this volume were presented at the Tenth Annual S- posium on Combinatorial Pattern Matching, held July 22 { 24, 1999 at the University of Warwick, England. They were selected from 26 abstracts subm- ted in response to the call for papers. In addition, invited lectures were given by JoanFeigenbaumfromAT&TLabsResearch(Massivegraphs: algorithms, app- cations, and open problems) and David Jones from the Department of Biology, University of Warwick (Optimizing biological sequences and protein structures using simulated annealing and genetic algorithms). The symposium was preceded by a two-day summer school set up to attract and train young researchers. The lecturers of the school were Alberto Ap- tolico (Computational Theories of Surprise), Joan Feigenbaum (Algorithmics of network-generatedmassivedatasets), Leszek Gasieniecand PaulGoldberg (The complexity of gene placement), David Jones (An introduction to computational molecularbiology), Arthur Lesk (Structuralalignmentandmaximalsubstructure extraction), Cenk Sahinalp(Questformeasuringdistancebetweenstrings: exact, approximate, and probabilistic algorithms), and Jim Storer. Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays. The goal is to derive non-trivial combi- torial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. Over recent years, a steady ?ow of high-quality research on this subject has changed a sparse set of isolated results into a fully-?edged area of algorithmics., The papers contained in this volume were presented at the Tenth Annual S- posium on Combinatorial Pattern Matching, held July 22 { 24, 1999 at the University of Warwick, England. They were selected from 26 abstracts subm- ted in response to the call for papers. In addition, invited lectures were given by JoanFeigenbaumfromAT&TLabsResearch(Massivegraphs:algorithms,app- cations, and open problems) and David Jones from the Department of Biology, University of Warwick (Optimizing biological sequences and protein structures using simulated annealing and genetic algorithms). The symposium was preceded by a two-day summer school set up to attract and train young researchers. The lecturers of the school were Alberto Ap- tolico (Computational Theories of Surprise), Joan Feigenbaum (Algorithmics of network-generatedmassivedatasets),Leszek Gasieniecand PaulGoldberg (The complexity of gene placement), David Jones (An introduction to computational molecularbiology), Arthur Lesk (Structuralalignmentandmaximalsubstructure extraction),Cenk Sahinalp(Questformeasuringdistancebetweenstrings:exact, approximate, and probabilistic algorithms), and Jim Storer. Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays. The goal is to derive non-trivial combi- torial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. Over recent years, a steady ?ow of high-quality research on this subject has changed a sparse set of isolated results into a fully-?edged area of algorithmics.
LC Classification Number
Q337.5
Artikelbeschreibung des Verkäufers
Info zu diesem Verkäufer
grandeagleretail
98,2% positive Bewertungen•2.8 Mio. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (1'055'678)
- 0***e (641)- Bewertung vom Käufer.Letzter MonatBestätigter KaufGood experience with this seller
- 2***l (534)- Bewertung vom Käufer.Letzter MonatBestätigter KaufHad an initial problem with the shipment of the order. I contacted the seller and he/ she was very helpful. Long story short, the issue was resolved and I received the book. Would definitely do business with this seller again.
- i***n (1923)- Bewertung vom Käufer.Letzter MonatBestätigter KaufThank you.
Noch mehr entdecken:
- Jährliche Zeitschriften,
- Jährliche Zeitschriften Nachrichten,
- Jährliche englische Zeitschriften,
- Jährliche Zeitschriften Sport,
- Jährliche Zeitschriften Lifestyle,
- Jährliche Zeitschriften-Genre,
- Jährliche Zeitschriften über Motorrad,
- Nachschlagewerke und Lexika Oxford-University-Press,
- Nachschlagewerke und Lexika Oxford-Oxford-University-Press,
- Oxford-University-Press Fachbücher, Lernen und Nachschlagen
grandeagleretail
98,2% positive Bewertungen•2.8 Mio. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (1'055'678)
- 0***e (641)- Bewertung vom Käufer.Letzter MonatBestätigter KaufGood experience with this seller
- 2***l (534)- Bewertung vom Käufer.Letzter MonatBestätigter KaufHad an initial problem with the shipment of the order. I contacted the seller and he/ she was very helpful. Long story short, the issue was resolved and I received the book. Would definitely do business with this seller again.
- i***n (1923)- Bewertung vom Käufer.Letzter MonatBestätigter KaufThank you.