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 : 16th annual symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005 : proceedings / / Alberto Apostolico, Maxime Crochemore, Kunsoo Park (eds.)
| Combinatorial pattern matching : 16th annual symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005 : proceedings / / Alberto Apostolico, Maxime Crochemore, Kunsoo Park (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XII, 452 p.) |
| Disciplina | 511/.6 |
| Altri autori (Persone) |
ApostolicoAlberto <1948->
CrochemoreMaxime <1947-> ParkKunsoo |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer algorithms
Combinatorial analysis |
| ISBN |
3-540-31562-4
3-540-26201-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 Algorithm of 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. |
| Altri titoli varianti | CPM 2005 |
| Record Nr. | UNINA-9910483301103321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial pattern matching : 10th annual symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings / / Maxime Crochemore, Mike Paterson, editors
| Combinatorial pattern matching : 10th annual symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings / / Maxime Crochemore, Mike Paterson, editors |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (VIII, 304 p.) |
| Disciplina | 005.1 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer algorithms
Combinatorial analysis |
| ISBN | 3-540-48452-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Shift-And Approach to Pattern Matching in LZW Compressed Text -- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text -- Pattern Matching in Text Compressed by Using Antidictionaries -- On the Structure of Syntenic Distance -- Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem -- Hybridization and Genome Rearrangement -- On the Complexity of Positional Sequencing by Hybridization -- GESTALT: Genomic Steiner Alignments -- Bounds on the Number of String Subsequences -- Approximate Periods of Strings -- Finding Maximal Pairs with Bounded Gap -- A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes -- A New Indexing Method for Approximate String Matching -- The Compression of Subsegments of Images Described by Finite Automata -- Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays -- Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions -- Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology -- Fast Multi-dimensional Approximate Pattern Matching -- Finding Common RNA Secondary Structures from RNA Sequences -- Finding Common Subsequences with Arcs and Pseudoknots -- Computing Similarity between RNA Structures. |
| Record Nr. | UNINA-9910143455603321 |
| Berlin : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial pattern matching : 10th annual symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings / / Maxime Crochemore, Mike Paterson, editors
| Combinatorial pattern matching : 10th annual symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings / / Maxime Crochemore, Mike Paterson, editors |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (VIII, 304 p.) |
| Disciplina | 005.1 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer algorithms
Combinatorial analysis |
| ISBN | 3-540-48452-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Shift-And Approach to Pattern Matching in LZW Compressed Text -- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text -- Pattern Matching in Text Compressed by Using Antidictionaries -- On the Structure of Syntenic Distance -- Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem -- Hybridization and Genome Rearrangement -- On the Complexity of Positional Sequencing by Hybridization -- GESTALT: Genomic Steiner Alignments -- Bounds on the Number of String Subsequences -- Approximate Periods of Strings -- Finding Maximal Pairs with Bounded Gap -- A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes -- A New Indexing Method for Approximate String Matching -- The Compression of Subsegments of Images Described by Finite Automata -- Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays -- Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions -- Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology -- Fast Multi-dimensional Approximate Pattern Matching -- Finding Common RNA Secondary Structures from RNA Sequences -- Finding Common Subsequences with Arcs and Pseudoknots -- Computing Similarity between RNA Structures. |
| Record Nr. | UNISA-996465736703316 |
| Berlin : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||