2007, ISBN: 9783540734369
The papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario,… Plus…
Indigo.ca new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise Details... |
2007, ISBN: 9783540734369
Springer, Taschenbuch, Auflage: 2007, 380 Seiten, Publiziert: 2007-10-04T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: biography, 1.29 kg, NLP, Kommunikation & Psychologie, Business & K… Plus…
amazon.de Frais d'envoiDie angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Details... |
Combinatorial Pattern Matching: 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) - Livres de poche
2007, ISBN: 3540734368
[EAN: 9783540734369], Gebraucht, sehr guter Zustand, [PU: Springer], No international shipping at this time through ABEbooks.Ex-library paperback in very nice condition with the usual mar… Plus…
AbeBooks.de GuthrieBooks, Spring Branch, TX, U.S.A. [52069477] [Rating: 5 (von 5)] NOT NEW BOOK. Frais d'envoi EUR 65.51 Details... |
Combinatorial Pattern Matching. 18th Annual Symposium, CPM 2007, London, Canada, July 2007, Proceedings. [Notes in Computer Science, Vol. 4580]. - Livres de poche
2007, ISBN: 9783540734369
380 p. Softcover/Paperback, [PU: Springer, Berlin/Heidelberg]
Antikbuch24.de |
2007, ISBN: 9783540734369
18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2007
lehmanns.de Frais d'envoiVersand in 10-14 Tagen. (EUR 9.95) Details... |
Combinatorial Pattern Matching: 18th Annual Symposium, Cpm 2007, London, Canada, July 9-11, 2007, Proceedings - nouveau livre
2007, ISBN: 9783540734369
The papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario,… Plus…
2007, ISBN: 9783540734369
Springer, Taschenbuch, Auflage: 2007, 380 Seiten, Publiziert: 2007-10-04T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: biography, 1.29 kg, NLP, Kommunikation & Psychologie, Business & K… Plus…
Combinatorial Pattern Matching: 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) - Livres de poche
2007
ISBN: 3540734368
[EAN: 9783540734369], Gebraucht, sehr guter Zustand, [PU: Springer], No international shipping at this time through ABEbooks.Ex-library paperback in very nice condition with the usual mar… Plus…
2007, ISBN: 9783540734369
18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2007
Données bibliographiques du meilleur livre correspondant
Auteur: | |
Titre: | |
ISBN: |
Informations détaillées sur le livre - Combinatorial Pattern Matching
EAN (ISBN-13): 9783540734369
ISBN (ISBN-10): 3540734368
Version reliée
Livre de poche
Date de parution: 2007
Editeur: Springer Berlin
366 Pages
Poids: 0,576 kg
Langue: eng/Englisch
Livre dans la base de données depuis 2007-03-25T04:31:08+02:00 (Paris)
Page de détail modifiée en dernier sur 2022-06-06T08:00:11+02:00 (Paris)
ISBN/EAN: 9783540734369
ISBN - Autres types d'écriture:
3-540-73436-8, 978-3-540-73436-9
Autres types d'écriture et termes associés:
Auteur du livre: zhang, bin, springer
Titre du livre: annual, canada, london 2007, match, combinatorial pattern matching, july, elf london, the pattern, cpm, symposium notes
Données de l'éditeur
Auteur: Bin Ma; Kaizhong Zhang
Titre: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings
Editeur: Springer; Springer Berlin
368 Pages
Date de parution: 2007-06-22
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XII, 368 p.
BC; Hardcover, Softcover / Informatik, EDV/Anwendungs-Software; Mustererkennung; Verstehen; Informatik; Alphabet; DOM; Pattern Matching; Variable; algorithms; approximation; bioinformatics; coding and data compression; combinatorial pattern matching; computational discrete mathematics; data analysis; data compression; data mining; dynamic programming; genome; algorithm analysis and problem complexity; data structures; Automated Pattern Recognition; Algorithms; Natural Language Processing (NLP); Data Mining and Knowledge Discovery; Computational and Systems Biology; Data Science; Algorithmen und Datenstrukturen; Natürliche Sprachen und maschinelle Übersetzung; Data Mining; Wissensbasierte Systeme, Expertensysteme; DV-gestützte Biologie/Bioinformatik; Datenbanken; EA
Invited Talks (Abstracts).- A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search.- Stringology: Some Classic and Some Modern Problems.- Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors.- Session 1: Alogirthmic Techniques I.- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.- On Demand String Sorting over Unbounded Alphabets.- Session 2: Approximate Pattern Matching.- Finding Witnesses by Peeling.- Cache-Oblivious Index for Approximate String Matching.- Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts.- Self-normalised Distance with Don’t Cares.- Session 3: Data Compression I.- Move-to-Front, Distance Coding, and Inversion Frequencies Revisited.- A Lempel-Ziv Text Index on Secondary Storage.- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts.- Most Burrows-Wheeler Based Compressors Are Not Optimal.- Session 4: Computational Biology I.- Non-breaking Similarity of Genomes with Gene Repetitions.- A New and Faster Method of Sorting by Transpositions.- Finding Compact Structural Motifs.- Session 5: Computational Biology II.- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants.- Computing Exact p-Value for Structured Motif.- Session 6: Algorithmic Techniques II.- Improved Sketching of Hamming Distance with Error Correcting.- Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications.- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge.- Space-Efficient Algorithms for Document Retrieval.- Session 7: Data Compression II.- Compressed Text Indexes with Fast Locate.- Processing Compressed Texts: A Tractability Border.- Session 8:Computational Biology III.- Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.- Identification of Distinguishing Motifs.- Algorithms for Computing the Longest Parameterized Common Subsequence.- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem.- Session 9: Pattern Analysis.- Two-Dimensional Range Minimum Queries.- Tiling Periodicity.- Fast and Practical Algorithms for Computing All the Runs in a String.- Longest Common Separable Pattern Among Permutations.- Session 10: Suffix Arrays and Trees.- Suffix Arrays on Words.- Efficient Computation of Substring Equivalence Classes with Suffix Arrays.- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.Autres livres qui pourraient ressembler au livre recherché:
Dernier livre similaire:
9783540354611 Combinatorial Pattern Matching (Moshe Lewenstein; Gabriel Valiente)
< pour archiver...