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.
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 | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
| Combinatorial Pattern Matching [[electronic resource] ] : 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-47732-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A linear time pattern matching algorithm between a string and a tree -- Tight comparison bounds for the string prefix-matching problem -- 3-D docking of protein molecules -- Minimal separators of two words -- Covering a string -- On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings -- An algorithm for locating non-overlapping regions of maximum alignment score -- Exact and approximation algorithms for the inversion distance between two chromosomes -- The maximum weight trace problem in multiple sequence alignment -- An algorithm for approximate tandem repeats -- Two dimensional pattern matching in a digitized image -- Analysis of a string edit problem in a probabilistic framework -- Detecting false matches in string matching algorithms -- On suboptimal alignments of biological sequences -- A fast filtration algorithm for the substring matching problem -- A unifying look at d-dimensional periodicities and space coverings -- Approximate string-matching over suffix trees -- Multiple sequence comparison and n-dimensional image reconstruction -- A new editing based distance between unordered labeled trees. |
| Record Nr. | UNISA-996466082003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
| Combinatorial Pattern Matching [[electronic resource] ] : Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (XI, 293 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Discrete mathematics Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Pattern Recognition Algorithm Analysis and Problem Complexity Discrete Mathematics Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-47357-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Probabilistic analysis of generalized suffix trees -- A language approach to string searching evaluation -- Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm -- Fast multiple keyword searching -- Heaviest increasing/common subsequence problems -- Approximate regular expression pattern matching with concave gap penalties -- Matrix longest common subsequence problem, duality and hilbert bases -- From regular expressions to DFA's using compressed NFA's -- Identifying periodic occurrences of a template with applications to protein structure -- Edit distance for genome comparison based on non-local operations -- 3-D substructure matching in protein Molecules -- Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract) -- Grammatical tree matching -- Theoretical and empirical comparisons of approximate string matching algorithms -- Fast and practical approximate string matching -- DZ A text compression algorithm for natural languages -- Multiple alignment with guaranteed error bounds and communication cost -- Two algorithms for the longest common subsequence of three (or more) strings -- Color Set Size problem with applications to string matching -- Computing display conflicts in string and circular string visualization -- Efficient randomized dictionary matching algorithms -- Dynamic dictionary matching with failure functions. |
| Record Nr. | UNISA-996465491703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages
| Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages |
| Autore | Van Deusen Mary S |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 1985 |
| Descrizione fisica | 1 online resource (340 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
Proceedings of the 12th Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory-Special Interest Group on Programming Languages Symposium on Principles of Programming Languages
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages |
| Record Nr. | UNINA-9910376091803321 |
Van Deusen Mary S
|
||
| [Place of publication not identified], : ACM, 1985 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory of Computing and Systems [[electronic resource] ] : ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992. Proceedings / / edited by Danny Dolev, Zvi Galil, Michael Rodeh
| Theory of Computing and Systems [[electronic resource] ] : ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992. Proceedings / / edited by Danny Dolev, Zvi Galil, Michael Rodeh |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (VIII, 224 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Computer memory systems Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Memory Structures |
| ISBN | 3-540-47214-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Merging and splitting priority queues and deques in parallel -- Lower bounds for the complexity of functions in a realistic RAM model -- On Boolean decision trees with faulty nodes -- Interval graphs, interval orders and the consistency of temporal events (extended abstract) -- Higher order functions in first order logics -- Reduction relations in strict applicative languages -- Approximation algorithms for minimum time broadcast -- The complexity of reconfiguring network models -- Optimal mapping in direct mapped cache environments -- New algorithms for generalized network flows -- Factoring polynomials via relation-finding -- New resultant inequalities and complex polynomial factorization -- Can symmetric Toeplitz solvers be strongly stable? -- Bounds on parallel computation of multivariate polynomials -- Time-lapse snapshots -- Concurrent Timestamping made simple -- Distributed evaluation: a tool for constructing distributed detection programs -- Foundations of asymptotical theory of Determinate Compact Testing -- Optimal k-colouring and k-nesting of intervals. |
| Record Nr. | UNISA-996465737003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||