|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-31562-9 |
| 003 |
DE-He213 |
| 005 |
20230406062033.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100925s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540315629
|9 978-3-540-31562-9
|
| 024 |
7 |
|
|a 10.1007/b137128
|2 doi
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 072 |
|
7 |
|a UMB
|2 thema
|
| 082 |
0 |
4 |
|a 518.1
|2 23
|
| 245 |
1 |
0 |
|a Combinatorial Pattern Matching
|h [electronic resource] :
|b 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings /
|c edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park.
|
| 250 |
|
|
|a 1st ed. 2005.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2005.
|
| 300 |
|
|
|a XII, 452 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 3537
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Artificial intelligence-Data processing.
|
| 650 |
|
0 |
|a Information storage and retrieval systems.
|
| 650 |
|
0 |
|a Natural language processing (Computer science).
|
| 650 |
|
0 |
|a Pattern recognition systems.
|
| 650 |
|
0 |
|a Bioinformatics.
|
| 650 |
1 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Data Science.
|
| 650 |
2 |
4 |
|a Information Storage and Retrieval.
|
| 650 |
2 |
4 |
|a Natural Language Processing (NLP).
|
| 650 |
2 |
4 |
|a Automated Pattern Recognition.
|
| 650 |
2 |
4 |
|a Bioinformatics.
|
| 700 |
1 |
|
|a Apostolico, Alberto.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Crochemore, Maxime.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Park, Kunsoo.
|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 9783540811770
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540262015
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3537
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/b137128
|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)
|
