000 | 04495nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-31562-9 | ||
003 | DE-He213 | ||
005 | 20160624101915.0 | ||
007 | cr nn 008mamaa | ||
008 | 100925s2005 gw | s |||| 0|eng d | ||
020 |
_a9783540315629 _9978-3-540-31562-9 |
||
024 | 7 |
_a10.1007/b137128 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aCombinatorial Pattern Matching _h[electronic resource] : _b16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005. Proceedings / _cedited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005. |
|
300 |
_aXII, 452 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v3537 |
|
505 | 0 | _aSharper 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 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aInformation storage and retrieval systems. | |
650 | 0 | _aText processing (Computer science. | |
650 | 0 | _aOptical pattern recognition. | |
650 | 0 | _aBioinformatics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aInformation Storage and Retrieval. |
650 | 2 | 4 | _aDocument Preparation and Text Processing. |
650 | 2 | 4 | _aPattern Recognition. |
650 | 2 | 4 | _aBioinformatics. |
700 | 1 |
_aApostolico, Alberto. _eeditor. |
|
700 | 1 |
_aCrochemore, Maxime. _eeditor. |
|
700 | 1 |
_aPark, Kunsoo. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540262015 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v3537 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/b137128 |
942 |
_2EBK3524 _cEBK |
||
999 |
_c32818 _d32818 |