000			06497cam a2200865 a 4500
001			ocn325462091
003			OCoLC
005			20250703150306.0
006			m o d
007			cr unu||||||||
008			000625s2000 gw a ob 101 0 engsd
040			_aSCPER _beng _epn _cCUSER _dWAU _dOCLCQ _dYNG _dOHI _dCSU _dOCLCQ _dDKDLA _dOL$ _dOCLCQ _dOCLCA _dNLGGC _dOCLCO _dOCLCA _dGW5XE _dOCLCF _dOCLCO _dOCL _dOCLCO _dOCLCQ _dYDX _dSHS _dUAB _dESU _dOCLCQ _dBUF _dLEAUB _dOCLCQ _dVT2 _dEUX _dOCLCQ _dUKAHL _dOCLCO _dOCLCQ _dINT _dWSU _dOCLCO _dOCLCL _dOCLCQ
015			_aGBA047297 _2bnb
016			_a2001014336X
016	7		_a007758361 _2Uk
019			_a150396778 _a644355251 _a769235317 _a968906453 _a1111216222 _a1152975061 _a1162707534 _a1238291258 _a1374611649
020			_a9783540451235 _q(electronic bk.)
020			_a3540451234 _q(electronic bk.)
020			_a9783662201190 _q(print)
020			_a3662201194
020			_z3540676333
020			_z9783540676331
020			_a9788354045120 _q(5)
020			_a8354045129
024	7		_a10.1007/3-540-45123-4 _2doi
029	1		_aNLGGC _b296861073
029	1		_aNZ1 _b15299783
035			_a(OCoLC)325462091 _z(OCoLC)150396778 _z(OCoLC)644355251 _z(OCoLC)769235317 _z(OCoLC)968906453 _z(OCoLC)1111216222 _z(OCoLC)1152975061 _z(OCoLC)1162707534 _z(OCoLC)1238291258 _z(OCoLC)1374611649
050		4	_aQA76.9.A43 _bC65 2000
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
072		7	_aUYQP _2thema
082	0	4	_a006.4015116 _221
084			_a54.10 _2bcl
049			_aMAIN
111	2		_aCPM (Symposium) _n(11th : _d2000 : _cMontréal, Québec) _933708
245	1	0	_aCombinatorial pattern matching : _b11th annual symposium, CPM 2000, Montreal, Canada, June 21-23, 2000 ; proceedings / _cRaffaele Giancarlo, David Sankoff (eds.).
246	3	0	_aCPM 2000
260			_aBerlin : _bSpringer, _c2000.
300			_a1 online resource (xi, 422 pages) : _billustrations
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file
347			_bPDF
490	1		_aLecture notes in computer science ; _v1848
500			_a"Presented at the 11th Annual Symposium on Combinatorial Pattern matching, held June 21-23, 2000 at the Université de Montréal"--Foreword
504			_aIncludes bibliographical references and author index.
588	0		_aPrint version record.
520			_aThis book constitutes the refereed proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000, held in Montreal, Canada, in June 2000. The 29 revised full papers presented together with 3 invited contributions and 2 tutorial lectures were carefully reviewed and selected from 44 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expression graphs, point sets and arrays as well as to advanced applications of CPM in areas such as Internet, computational biology, multimedia systems, information retrieval, data compression, and pattern recognition.
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 algorithms _vCongresses. _914835
650		0	_aCombinatorial analysis _vCongresses. _915000
650		6	_aAlgorithmes _vCongrès. _917080
650		6	_aAnalyse combinatoire _vCongrès. _918518
650		7	_aCombinatorial analysis _2fast _95330
650		7	_aComputer algorithms _2fast _9896
650	1	7	_aCombinatorische meetkunde. _2gtt _915127
650	1	7	_aMatching. _2gtt _915129
650	1	7	_aAlgoritmen. _2gtt
650	1	7	_aPatroonherkenning. _2gtt
655		7	_aproceedings (reports) _2aat
655		7	_aConference papers and proceedings _2fast _96065
655		7	_aCongressen (vorm) _2gtt _98970
655		7	_aConference papers and proceedings. _2lcgft _96065
655		7	_aActes de congrès. _2rvmgf _9609890
700	1		_aGiancarlo, Raffaele. _923011
700	1		_aSankoff, David. _933711
776	0	8	_iPrint version: _aSymposium on Combinatorial Pattern Matching (11th : 2000 : Montréal, Québec). _tCombinatorial pattern matching. _dBerlin : Springer, 2000 _z3540676333 _w(OCoLC)44492409
830		0	_aLecture notes in computer science ; _v1848.
856	4	0	_uhttps://link.springer.com/10.1007/3-540-45123-4
938			_aAskews and Holts Library Services _bASKH _nAH20755054
938			_aYBP Library Services _bYANK _n13373136
994			_a92 _bATIST
999			_c638854 _d638854