000 04866nam a22006255i 4500
001 978-3-540-31562-9
003 DE-He213
005 20240730173414.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
072 7 _aUMB
_2thema
082 0 4 _a518.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.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_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 Algorithmof 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 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aInformation storage and retrieval systems.
_922213
650 0 _aNatural language processing (Computer science).
_94741
650 0 _aPattern recognition systems.
_93953
650 0 _aBioinformatics.
_99561
650 1 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
650 2 4 _aInformation Storage and Retrieval.
_923927
650 2 4 _aNatural Language Processing (NLP).
_931587
650 2 4 _aAutomated Pattern Recognition.
_931568
650 2 4 _aBioinformatics.
_99561
700 1 _aApostolico, Alberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9108211
700 1 _aCrochemore, Maxime.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9108212
700 1 _aPark, Kunsoo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9108213
710 2 _aSpringerLink (Online service)
_9108214
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540262015
776 0 8 _iPrinted edition:
_z9783540811770
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3537
_9108215
856 4 0 _uhttps://doi.org/10.1007/b137128
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c88910
_d88910