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] ] : 9th Annual Symposium, CPM'98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings / / edited by Martin Farach-Colton
| Combinatorial Pattern Matching [[electronic resource] ] : 9th Annual Symposium, CPM'98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings / / edited by Martin Farach-Colton |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (IX, 259 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Computers Computer science—Mathematics Combinatorics Pattern Recognition Algorithm Analysis and Problem Complexity Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-540-69054-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A fast bit-vector algorithm for approximate string matching based on dynamic programming -- A bit-parallel approach to suffix automata: Fast extended string matching -- A dictionary matching algorithm fast on the average for terms of varying length -- A very fast string matching algorithm for small alphabets and long patterns -- Approximate word sequence matching over Sparse Suffix Trees -- Efficient parallel algorithm for the editing distance between ordered trees -- Reporting exact and approximate regular expression matches -- An approximate oracle for distance in metric spaces -- A rotation invariant filter for two-dimensional string matching -- Constructing suffix arrays for multi-dimensional matrices -- Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version -- Comparison of coding DNA -- Fixed topology alignment with recombination -- Aligning alignments -- Efficient special cases of pattern matching with swaps -- Aligning DNA sequences to minimize the change in protein -- Genome halving. |
| Record Nr. | UNINA-9910144908203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 9th Annual Symposium, CPM'98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings / / edited by Martin Farach-Colton
| Combinatorial Pattern Matching [[electronic resource] ] : 9th Annual Symposium, CPM'98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings / / edited by Martin Farach-Colton |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (IX, 259 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Computers Computer science—Mathematics Combinatorics Pattern Recognition Algorithm Analysis and Problem Complexity Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-540-69054-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A fast bit-vector algorithm for approximate string matching based on dynamic programming -- A bit-parallel approach to suffix automata: Fast extended string matching -- A dictionary matching algorithm fast on the average for terms of varying length -- A very fast string matching algorithm for small alphabets and long patterns -- Approximate word sequence matching over Sparse Suffix Trees -- Efficient parallel algorithm for the editing distance between ordered trees -- Reporting exact and approximate regular expression matches -- An approximate oracle for distance in metric spaces -- A rotation invariant filter for two-dimensional string matching -- Constructing suffix arrays for multi-dimensional matrices -- Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version -- Comparison of coding DNA -- Fixed topology alignment with recombination -- Aligning alignments -- Efficient special cases of pattern matching with swaps -- Aligning DNA sequences to minimize the change in protein -- Genome halving. |
| Record Nr. | UNISA-996466350403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings / / edited by Alberto Apostolico, Jotun Hein
| Combinatorial Pattern Matching [[electronic resource] ] : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings / / edited by Alberto Apostolico, Jotun Hein |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (VIII, 284 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Pattern recognition Algorithms Information storage and retrieval Computer science—Mathematics Combinatorics Theory of Computation Pattern Recognition Algorithm Analysis and Problem Complexity Information Storage and Retrieval Discrete Mathematics in Computer Science |
| ISBN | 3-540-69214-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | An improved pattern matching algorithm for strings in terms of straight-line programs -- Episode matching -- Efficient algorithms for approximate string matching with swaps -- On the complexity of pattern matching for highly compressed two-dimensional texts -- Estimating the probability of approximate matches -- Space- and time-efficient decoding with canonical huffman trees -- On weak circular squares in binary words -- An easy case of sorting by reversals -- External inverse pattern matching -- Distributed generation of suffix arrays -- Direct construction of compact directed acyclic word graphs -- Approximation algorithms for the fixed-topology phylogenetic number problem -- A new algorithm for the ordered tree inclusion problem -- On incremental computation of transitive closure and greedy alignment -- Aligning coding DNA in the presence of frame-shift errors -- A filter method for the weighted local similarity search problem -- Trie-based data structures for sequence assembly -- Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices -- Banishing bias from consensus sequences -- On the Nadeau-Taylor theory of conserved chromosome segments -- Iterative versus simultaneous multiple sequence alignment -- Modern comparative lexicostatistics. |
| Record Nr. | UNINA-9910144925103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings / / edited by Alberto Apostolico, Jotun Hein
| Combinatorial Pattern Matching [[electronic resource] ] : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings / / edited by Alberto Apostolico, Jotun Hein |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (VIII, 284 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Pattern recognition Algorithms Information storage and retrieval Computer science—Mathematics Combinatorics Theory of Computation Pattern Recognition Algorithm Analysis and Problem Complexity Information Storage and Retrieval Discrete Mathematics in Computer Science |
| ISBN | 3-540-69214-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | An improved pattern matching algorithm for strings in terms of straight-line programs -- Episode matching -- Efficient algorithms for approximate string matching with swaps -- On the complexity of pattern matching for highly compressed two-dimensional texts -- Estimating the probability of approximate matches -- Space- and time-efficient decoding with canonical huffman trees -- On weak circular squares in binary words -- An easy case of sorting by reversals -- External inverse pattern matching -- Distributed generation of suffix arrays -- Direct construction of compact directed acyclic word graphs -- Approximation algorithms for the fixed-topology phylogenetic number problem -- A new algorithm for the ordered tree inclusion problem -- On incremental computation of transitive closure and greedy alignment -- Aligning coding DNA in the presence of frame-shift errors -- A filter method for the weighted local similarity search problem -- Trie-based data structures for sequence assembly -- Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices -- Banishing bias from consensus sequences -- On the Nadeau-Taylor theory of conserved chromosome segments -- Iterative versus simultaneous multiple sequence alignment -- Modern comparative lexicostatistics. |
| Record Nr. | UNISA-996465756903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings / / edited by Maxime Crochemore, Dan Gusfield
| Combinatorial Pattern Matching [[electronic resource] ] : Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings / / edited by Maxime Crochemore, Dan Gusfield |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (IX, 331 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Discrete mathematics Algorithms Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Discrete Mathematics Algorithm Analysis and Problem Complexity Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-48450-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A space efficient algorithm for finding the best non-overlapping alignment score -- The parameterized complexity of sequence alignment and consensus -- Computing all suboptimal alignments in linear space -- Approximation algorithms for multiple sequence alignment -- A context dependent method for comparing sequences -- Fast identification of approximately matching substrings -- Alignment of trees — An alternative to tree edit -- Parametric recomputing in alignment graphs -- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms -- A text compression scheme that allows fast searching directly in the compressed file -- An alphabet-independent optimal parallel search for three dimensional pattern -- Unit route upper bound for string-matching on hypercube -- Computation of squares in a string -- Minimization of sequential transducers -- Shortest common superstrings for strings of random letters -- Maximal common subsequences and minimal common supersequences -- Dictionary-matching on unbounded alphabets: Uniform length dictionaries -- Proximity matching using fixed-queries trees -- Query primitives for tree-structured data -- Multiple matching of parameterized patterns -- Approximate string matching with don't care characters -- Matching with matrix norm minimization -- Approximate string matching and local similarity -- Polynomial-time algorithms for computing characteristic strings -- Recent methods for RNA modeling using stochastic context-free grammars -- Efficient bounds for oriented chromosome inversion distance. |
| Record Nr. | UNISA-996466248203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| 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 Set Theory [[electronic resource] ] : With a Gentle Introduction to Forcing / / by Lorenz J. Halbeisen
| Combinatorial Set Theory [[electronic resource] ] : With a Gentle Introduction to Forcing / / by Lorenz J. Halbeisen |
| Autore | Halbeisen Lorenz J |
| Edizione | [2nd ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVI, 594 p. 20 illus.) |
| Disciplina | 511.322 |
| Collana | Springer Monographs in Mathematics |
| Soggetto topico |
Mathematical logic
Combinatorics Mathematical Logic and Foundations |
| ISBN | 3-319-60231-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Setting -- First-Order Logic in a Nutshell -- Axioms of Set Theory -- Overture: Ramsey's Theorem -- Cardinal Relations in ZF Only -- Forms of Choice -- How to Make Two Balls from One -- Models of Set Theory with Atoms -- Thirteen Cardinals and Their Relations -- The Shattering Number Revisited -- Happy Families and Their Relatives -- Coda: A Dual Form of Ramsey’s Theorem -- The Idea of Forcing -- Martin's Axiom -- The Notion of Forcing -- Proving Unprovability -- Models in Which AC Fails -- Combining Forcing Notions -- Models in Which p=c -- Suslin’s Problem -- Properties of Forcing Extensions -- Cohen Forcing Revisited -- Sacks Forcing -- Silver-Like Forcing Notions -- Miller Forcing -- Mathias Forcing -- How Many Ramsey Ultrafilters Exist? -- Combinatorial Properties of Sets of Partitions -- Suite. |
| Record Nr. | UNINA-9910254296403321 |
Halbeisen Lorenz J
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial stochastic processes [e-book] : ecole d'eté de probabilités de Saint-Flour XXXII-2002 / J. Pitman ; editor, Jean Picard
| Combinatorial stochastic processes [e-book] : ecole d'eté de probabilités de Saint-Flour XXXII-2002 / J. Pitman ; editor, Jean Picard |
| Autore | Pitman, Jim |
| Pubbl/distr/stampa | Berlin : Springer, c2006 |
| Descrizione fisica | v. : digital |
| Disciplina | 519.2 |
| Altri autori (Persone) | Picard, Jean |
| Altri autori (Convegni) | Ecole d'été de probabilités de Saint-Flour <32 ; 2002> |
| Collana | Lecture notes in mathematics, 0075-8434 ; 1875 |
| Soggetto topico |
Combinatorics
Distribution (Probability theory) |
| ISBN | 9783540342663 |
| Classificazione |
AMS 05A
AMS 60C05 AMS 60J65 AMS 60G09 AMS 60J80 LC QA278.2.P68 |
| Formato | Software  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000565549707536 |
|
Pitman, Jim
|
||
| Berlin : Springer, c2006 | ||
| Software | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Combinatorial Structures in Algebra and Geometry [[electronic resource] ] : NSA 26, Constanța, Romania, August 26–September 1, 2018 / / edited by Dumitru I. Stamate, Tomasz Szemberg
| Combinatorial Structures in Algebra and Geometry [[electronic resource] ] : NSA 26, Constanța, Romania, August 26–September 1, 2018 / / edited by Dumitru I. Stamate, Tomasz Szemberg |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (VIII, 182 p. 40 illus., 6 illus. in color.) |
| Disciplina | 511.6 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Commutative algebra
Commutative rings Algebraic geometry Combinatorics Graph theory Algebra Field theory (Physics) Commutative Rings and Algebras Algebraic Geometry Graph Theory Field Theory and Polynomials |
| ISBN | 3-030-52111-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Nearly normally torsionfree ideals (Andrei-Ciobanu) -- Gröbner-nice pairs of ideals (Stamate) -- Veneroni maps (Tutaj-Gasi´nska et al.) -- On the symbolic powers of binomial edge ideals (Herzog et al.) -- Multigraded Betti numbers of some path ideals (Erey) -- Depth of an initial ideal (Tsuchiya et al.) -- Asymptotic behavior of symmetric ideals: A brief survey (Römer et al.) -- On piecewise-linear homeomorphisms between distributive and anti-blocking polyhedra (Sanyal et al.) -- The Bass-Quillen Conjecture and Swan’s question (Popescu) -- Licci level Stanley-Reisner ideals with height three and with type two (Yoshida et al.) -- Homological and combinatorial properties of powers of cover ideals of graphs (Fakhari) -- Fermat-type arrangements (Szpond). |
| Record Nr. | UNINA-9910484208303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Structures in Algebra and Geometry [[electronic resource] ] : NSA 26, Constanța, Romania, August 26–September 1, 2018 / / edited by Dumitru I. Stamate, Tomasz Szemberg
| Combinatorial Structures in Algebra and Geometry [[electronic resource] ] : NSA 26, Constanța, Romania, August 26–September 1, 2018 / / edited by Dumitru I. Stamate, Tomasz Szemberg |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (VIII, 182 p. 40 illus., 6 illus. in color.) |
| Disciplina | 511.6 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Commutative algebra
Commutative rings Algebraic geometry Combinatorics Graph theory Algebra Field theory (Physics) Commutative Rings and Algebras Algebraic Geometry Graph Theory Field Theory and Polynomials |
| ISBN | 3-030-52111-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Nearly normally torsionfree ideals (Andrei-Ciobanu) -- Gröbner-nice pairs of ideals (Stamate) -- Veneroni maps (Tutaj-Gasi´nska et al.) -- On the symbolic powers of binomial edge ideals (Herzog et al.) -- Multigraded Betti numbers of some path ideals (Erey) -- Depth of an initial ideal (Tsuchiya et al.) -- Asymptotic behavior of symmetric ideals: A brief survey (Römer et al.) -- On piecewise-linear homeomorphisms between distributive and anti-blocking polyhedra (Sanyal et al.) -- The Bass-Quillen Conjecture and Swan’s question (Popescu) -- Licci level Stanley-Reisner ideals with height three and with type two (Yoshida et al.) -- Homological and combinatorial properties of powers of cover ideals of graphs (Fakhari) -- Fermat-type arrangements (Szpond). |
| Record Nr. | UNISA-996418254803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Soggetto topico
-
Combinatorics
(447)
- Algorithms (127)
- Algorithm Analysis and Problem Complexity (105)
- Computers (98)
- Theory of Computation (79)