000			04113nam a22005535i 4500
001			978-3-540-45123-5
003			DE-He213
005			20160624101957.0
007			cr nn 008mamaa
008			121227s2000 gw | s |||| 0|eng d
020			_a9783540451235 _9978-3-540-45123-5
024	7		_a10.1007/3-540-45123-4 _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] : _b11th Annual Symposium, CPM 2000 Montreal, Canada, June 21–23, 2000 Proceedings / _cedited by Raffaele Giancarlo, David Sankoff.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2000.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2000.
300			_aXI, 426 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 ; _v1848
505	0		_aInvited Lectures -- Identifying and Filtering Near-Duplicate Documents -- Machine Learning for Efficient Natural-Language Processing -- Browsing around a Digital Library: Today and Tomorrow -- Summer School Lectures -- Algorithmic Aspects of Speech Recognition: A Synopsis -- Some Results on Flexible-Pattern Discovery -- Contributed Papers -- Explaining and Controlling Ambiguity in Dynamic Programming -- A Dynamic Edit Distance Table -- Parametric Multiple Sequence Alignment and Phylogeny Construction -- Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment -- A Polynomial Time Approximation Scheme for the Closest Substring Problem -- Approximation Algorithms for Hamming Clustering Problems -- Approximating the Maximum Isomorphic Agreement Subtree Is Hard -- A Faster and Unifying Algorithm for Comparing Trees -- Incomplete Directed Perfect Phylogeny -- The Longest Common Subsequence Problem for Arc-Annotated Sequences -- Boyer—Moore String Matching over Ziv-Lempel Compressed Text -- A Boyer—Moore Type Algorithm for Compressed Pattern Matching -- Approximate String Matching over Ziv—Lempel Compressed Text -- Improving Static Compression Schemes by Alphabet Extension -- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments -- A Lower Bound for the Breakpoint Phylogeny Problem -- Structural Properties and Tractability Results for Linear Synteny -- Shift Error Detection in Standardized Exams -- An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) -- The Combinatorial Partitioning Method -- Compact Suffix Array -- Linear Bidirectional On-Line Construction of Affix Trees -- Using Suffix Trees for Gapped Motif Discovery -- Indexing Text with Approximate q-Grams -- Simple Optimal String Matching Algorithm -- Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts -- Periods and Quasiperiods Characterization -- Finding Maximal Quasiperiodicities in Strings -- On the Complexity of Determining the Period of a String.
650		0	_aComputer 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	_aCombinatorics.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aPattern Recognition.
650	2	4	_aDocument Preparation and Text Processing.
650	2	4	_aInformation Storage and Retrieval.
650	2	4	_aCombinatorics.
700	1		_aGiancarlo, Raffaele. _eeditor.
700	1		_aSankoff, David. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540676331
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v1848
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-45123-4
942			_2EBK5191 _cEBK
999			_c34485 _d34485