|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-35461-1 |
| 003 |
DE-He213 |
| 005 |
20230406051526.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540354611
|9 978-3-540-35461-1
|
| 024 |
7 |
|
|a 10.1007/11780441
|2 doi
|
| 050 |
|
4 |
|a Q337.5
|
| 050 |
|
4 |
|a TK7882.P3
|
| 072 |
|
7 |
|a UYQP
|2 bicssc
|
| 072 |
|
7 |
|a COM016000
|2 bisacsh
|
| 072 |
|
7 |
|a UYQP
|2 thema
|
| 082 |
0 |
4 |
|a 006.4
|2 23
|
| 245 |
1 |
0 |
|a Combinatorial Pattern Matching
|h [electronic resource] :
|b 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings /
|c edited by Moshe Lewenstein, Gabriel Valiente.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XII, 420 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4009
|
| 505 |
0 |
|
|a Asynchronous Pattern Matching -- Asynchronous Pattern Matching -- SNP and Haplotype Analysis - Algorithms and Applications -- Identifying Co-referential Names Across Large Corpora -- Session 1. Data Structures -- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents -- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE -- Session 2. Indexing Data Structures -- A Linear Size Index for Approximate Pattern Matching -- On-Line Linear-Time Construction of Word Suffix Trees -- Obtaining Provably Good Performance from Suffix Trees in Secondary Storage -- Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures -- Session 3. Probabilistic and Algebraic Techniques -- New Bounds for Motif Finding in Strong Instances -- Fingerprint Clustering with Bounded Number of Missing Values -- Tiling an Interval of the Discrete Line -- Common Substrings in Random Strings -- Session 4. Applications in Molecular Biology I -- On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem -- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms -- Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees -- An Improved Algorithm for the Macro-evolutionary Phylogeny Problem -- Session 5. String Matching I -- Property Matching and Weighted Matching -- Faster Two Dimensional Scaled Matching -- Session 6. Applications in Molecular Biology II -- Approximation of RNA Multiple Structural Alignment -- Finding Common RNA Pseudoknot Structures in Polynomial Time -- A Compact Mathematical Programming Formulation for DNA Motif Finding -- Local Alignment of RNA Sequences with Arbitrary Scoring Schemes -- Session 7. Applications in Molecular Biology III -- An Algorithm for Sorting by Reciprocal Translocations -- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs -- Session 8. Data Compression -- A Simpler Analysis of Burrows-Wheeler Based Compression -- Statistical Encoding of Succinct Data Structures -- Dynamic Entropy-Compressed Sequences and Full-Text Indexes -- Reducing the Space Requirement of LZ-Index -- Session 9. String Matching II -- Faster Algorithms for Computing Longest Common Increasing Subsequences -- New Algorithms for Text Fingerprinting -- Sublinear Algorithms for Parameterized Matching -- Approximate Matching in Weighted Sequences -- Session 10. Dynamic Programming -- Algorithms for Finding a Most Similar Subforest -- Efficient Algorithms for Regular Expression Constrained Sequence Alignment -- Large Scale Matching for Position Weight Matrices.
|
| 650 |
|
0 |
|a Pattern recognition systems.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Natural language processing (Computer science).
|
| 650 |
|
0 |
|a Information storage and retrieval systems.
|
| 650 |
|
0 |
|a Bioinformatics.
|
| 650 |
|
0 |
|a Artificial intelligence-Data processing.
|
| 650 |
1 |
4 |
|a Automated Pattern Recognition.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Natural Language Processing (NLP).
|
| 650 |
2 |
4 |
|a Information Storage and Retrieval.
|
| 650 |
2 |
4 |
|a Bioinformatics.
|
| 650 |
2 |
4 |
|a Data Science.
|
| 700 |
1 |
|
|a Lewenstein, Moshe.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Valiente, Gabriel.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540825753
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540354550
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4009
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11780441
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
