- 5 Résultats
prix le plus bas: € 81,41, prix le plus élevé: € 119,00, prix moyen: € 95,95
1
Combinatorial Pattern Matching - >100
Commander
sur ebooks.com
€ 119,00
CommanderLien sponsorisé
>100:

Combinatorial Pattern Matching - nouveau livre

2005, ISBN: 9783540315629

The 16th Annual Symposium on Combinatorial Pattern Matching was held on Jeju Island, Korea on June 19–22, 2005. Previous meetings were held in Paris, London, Tucson, Padova, Asilomar, Hel… Plus…

new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise
2
Commander
sur lehmanns.de
€ 96,88
Envoi: € 0,001
CommanderLien sponsorisé

Alberto Apostolico; Maxime Crochemore; Kunsoo Park:

Combinatorial Pattern Matching - nouveau livre

2005, ISBN: 9783540315629

16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Berlin Heidelberg, 2005

Frais d'envoiDownload sofort lieferbar. (EUR 0.00)
3
Combinatorial Pattern Matching
Combinatorial Pattern Matching - nouveau livre

2005

ISBN: 9783540315629

Combinatorial Pattern Matching - 16th Annual Symposium CPM 2005 Jeju Island Korea June 19-22 2005 Proceedings: ab 96.49 € eBooks > Fachthemen & Wissenschaft > Wissenschaften allgemein Spr… Plus…

Frais d'envoiin stock, , , zzgl. Versandkosten., Livraison non-comprise
4
Combinatorial Pattern Matching : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings - I.N. Sneddon
Commander
sur hive.co.uk
£ 72,68
(environ € 81,41)
CommanderLien sponsorisé
I.N. Sneddon:
Combinatorial Pattern Matching : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings - nouveau livre

2005, ISBN: 9783540315629

; PDF; Computing, Springer Berlin Heidelberg

  - No. 9783540315629. Frais d'envoiInstock, Despatched same working day before 3pm, zzgl. Versandkosten., Livraison non-comprise
5
Commander
sur eBook.de
€ 85,99
Envoi: € 0,001
CommanderLien sponsorisé
Combinatorial Pattern Matching - nouveau livre

2005, ISBN: 9783540315629

Combinatorial Pattern Matching ab 85.99 EURO 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings Medien > Bücher, [PU: Springer, Berlin/Heidelberg]

  - Nr. Frais d'envoi, , DE. (EUR 0.00)

1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre

Informations détaillées sur le livre - Combinatorial Pattern Matching


EAN (ISBN-13): 9783540315629
Date de parution: 2005
Editeur: Springer Berlin Heidelberg

Livre dans la base de données depuis 2017-01-15T21:42:10+01:00 (Paris)
Page de détail modifiée en dernier sur 2022-02-22T12:31:01+01:00 (Paris)
ISBN/EAN: 9783540315629

ISBN - Autres types d'écriture:
978-3-540-31562-9
Autres types d'écriture et termes associés:
Titre du livre: korea annual, pattern


Données de l'éditeur

Auteur: Alberto Apostolico; Maxime Crochemore; Kunsoo Park
Titre: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Combinatorial Pattern Matching - 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings
Editeur: Springer; Springer Berlin
452 Pages
Date de parution: 2005-05-13
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XII, 452 p.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; Pattern Matching; Variable; algorithms; applications in molecular biology; bioinformatics; biology; complexity; data mining; genome; information retrieval; natural language processing; pattern recognition; string algorithms; symbolic computing; text searching; algorithm analysis and problem complexity; data structures; C; Algorithms; Data Science; Information Storage and Retrieval; Natural Language Processing (NLP); Automated Pattern Recognition; Bioinformatics; Computer Science; Datenbanken; Informationsrückgewinnung, Information Retrieval; Data Warehousing; Natürliche Sprachen und maschinelle Übersetzung; Mustererkennung; DV-gestützte Biologie/Bioinformatik; BC

Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern.- On the Longest Common Rigid Subsequence Problem.- Text Indexing with Errors.- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space.- Succinct Suffix Arrays Based on Run-Length Encoding.- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets.- Faster Algorithms for ?,?-Matching and Related Problems.- A Fast Algorithm for Approximate String Matching on Gene Sequences.- Approximate Matching in the L 1 Metric.- An Efficient Algorithm for Generating Super Condensed Neighborhoods.- The Median Problem for the Reversal Distance in Circular Bacterial Genomes.- Using PQ Trees for Comparative Genomics.- Hardness of Optimal Spaced Seed Design.- Weighted Directed Word Graph.- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets.- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression.- DNA Compression Challenge Revisited: A Dynamic Programming Approach.- On the Complexity of Sparse Exon Assembly.- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery.- Incremental Inference of Relational Motifs with a Degenerate Alphabet.- Speeding up Parsing of Biological Context-Free Grammars.- A New Periodicity Lemma.- Two Dimensional Parameterized Matching.- An Optimal Algorithm for Online Square Detection.- A Simple Fast Hybrid Pattern-Matching Algorithm.- Prefix-Free Regular-Expression Matching.- Reducing the Size of NFAs by Using Equivalences and Preorders.- Regular Expression Constrained Sequence Alignment.- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees.- A Polynomial Time Matching Algorithmof Ordered Tree Patterns Having Height-Constrained Variables.- Assessing the Significance of Sets of Words.- Inferring a Graph from Path Frequency.- Exact and Approximation Algorithms for DNA Tag Set Design.- Parametric Analysis for Ungapped Markov Models of Evolution.- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements.- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation.- Mass Spectra Alignments and Their Significance.
Includes supplementary material: sn.pub/extras

< pour archiver...