Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithm Theory — SWAT '92
| Algorithm Theory — SWAT '92 |
| Pubbl/distr/stampa | Springer Berlin Heidelberg |
| Altri autori (Persone) |
NurmiOtto
UkkonenEsko |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Algorithm Theory — SWAT '92 |
| Record Nr. | UNISA-996465771603316 |
| Springer Berlin Heidelberg | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 22nd International Conference, ALT 2011, Espoo, Finland, October 5-7, 2011, Proceedings / / edited by Jyriki Kivinen, Csaba Szepesvári, Esko Ukkonen, Thomas Zeugmann
| Algorithmic Learning Theory [[electronic resource] ] : 22nd International Conference, ALT 2011, Espoo, Finland, October 5-7, 2011, Proceedings / / edited by Jyriki Kivinen, Csaba Szepesvári, Esko Ukkonen, Thomas Zeugmann |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XIII, 453 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Algorithms Computers Computer logic Application software Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Information Systems Applications (incl. Internet) |
| ISBN | 3-642-24412-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465413303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings / / edited by Gregory Kucherov, Esko Ukkonen
| Combinatorial Pattern Matching [[electronic resource] ] : 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings / / edited by Gregory Kucherov, Esko Ukkonen |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIII, 370 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Pattern recognition systems Bioinformatics Algorithms Artificial intelligence—Data processing Information storage and retrieval systems Theory of Computation Automated Pattern Recognition Computational and Systems Biology Data Science Information Storage and Retrieval |
| ISBN | 3-642-02441-6 |
| Classificazione |
DAT 537f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract). |
| Record Nr. | UNISA-996465843503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 6th Annual Symposium, CPM 95, Espoo, Finland, July 5 - 7, 1995. Proceedings / / edited by Zvi Galil, Esko Ukkonen
| Combinatorial Pattern Matching [[electronic resource] ] : 6th Annual Symposium, CPM 95, Espoo, Finland, July 5 - 7, 1995. Proceedings / / edited by Zvi Galil, Esko Ukkonen |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (VIII, 412 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Pattern recognition Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Theory of Computation Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-49412-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computing similarity between RNA strings -- Of chicken teeth and mouse eyes, or generalized character compatibility -- Efficient string matching on coded texts -- Fast approximate matching using suffix trees -- Common subsequences and supersequences and their expected length -- Pattern matching in directed graphs -- Constant-space string matching with smaller number of comparisons: sequential sampling -- Multi-dimensional pattern matching with dimensional wildcards -- Minimizing phylogenetic number to find good evolutionary trees -- Making the shortest-paths approach to sum-of-pairs multiple sequence alignment more space efficient in practice -- An efficient algorithm for developing topologically valid matchings -- Polynomial-time algorithm for computing translocation distance between genomes -- On the complexity of comparing evolutionary trees -- Suffix cactus: A cross between suffix tree and suffix array -- Pattern-matching for strings with short descriptions -- Pairwise alignment with scoring on tuples -- Matching a set of strings with variable length don't cares -- Three-dimensional pattern matching in protein structure analysis -- Genome analysis: Pattern search in biological macromolecules -- Matching patterns of an automaton -- New results and open problems related to non-standard stringology -- String matching in hypertext -- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree -- A new flexible algorithm for the longest common subsequence problem -- Smaller representations for finite-state transducers and finite-state automata -- Multiple sequence comparison: A peptide matching approach -- On a technique for parsing a string -- Dictionary look-up with small errors -- On the editing distance between undirected acyclic graphs and related problems. |
| Record Nr. | UNISA-996466161903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||