000			04656nam a22003855i 4500
001			297527
003			MX-SnUAN
005			20160429155426.0
007			cr nn 008mamaa
008			150903s2007 gw | o |||| 0|eng d
020			_a9783540734376 _99783540734376
024	7		_a10.1007/9783540734376 _2doi
035			_avtls000350581
039		9	_a201509030200 _bVLOAD _c201405060237 _dVLOAD _y201402171100 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.A43
100	1		_aMa, Bin. _eeditor. _9332183
245	1	0	_aCombinatorial Pattern Matching : _b18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings / _cedited by Bin Ma, Kaizhong Zhang.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
300			_axii, 366 páginas _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v4580
500			_aSpringer eBooks
505	0		_aInvited Talks (Abstracts) -- A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search -- Stringology: Some Classic and Some Modern Problems -- Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors -- Session 1: Alogirthmic Techniques I -- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions -- On Demand String Sorting over Unbounded Alphabets -- Session 2: Approximate Pattern Matching -- Finding Witnesses by Peeling -- Cache-Oblivious Index for Approximate String Matching -- Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts -- Self-normalised Distance with Don’t Cares -- Session 3: Data Compression I -- Move-to-Front, Distance Coding, and Inversion Frequencies Revisited -- A Lempel-Ziv Text Index on Secondary Storage -- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts -- Most Burrows-Wheeler Based Compressors Are Not Optimal -- Session 4: Computational Biology I -- Non-breaking Similarity of Genomes with Gene Repetitions -- A New and Faster Method of Sorting by Transpositions -- Finding Compact Structural Motifs -- Session 5: Computational Biology II -- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants -- Computing Exact p-Value for Structured Motif -- Session 6: Algorithmic Techniques II -- Improved Sketching of Hamming Distance with Error Correcting -- Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications -- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge -- Space-Efficient Algorithms for Document Retrieval -- Session 7: Data Compression II -- Compressed Text Indexes with Fast Locate -- Processing Compressed Texts: A Tractability Border -- Session 8: Computational Biology III -- Common Structured Patterns in Linear Graphs: Approximation and Combinatorics -- Identification of Distinguishing Motifs -- Algorithms for Computing the Longest Parameterized Common Subsequence -- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem -- Session 9: Pattern Analysis -- Two-Dimensional Range Minimum Queries -- Tiling Periodicity -- Fast and Practical Algorithms for Computing All the Runs in a String -- Longest Common Separable Pattern Among Permutations -- Session 10: Suffix Arrays and Trees -- Suffix Arrays on Words -- Efficient Computation of Substring Equivalence Classes with Suffix Arrays -- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.
520			_aThis book constitutes the refereed proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007, held in London, Canada in July 2007. The 32 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 64 submissions. The papers are organized in topical sections on algorithmic techniques, approximate pattern matching, data compression, computational biology, pattern analysis, suffix arrays and trees, as well as algorithmic techniques.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aZhang, Kaizhong. _eeditor. _9333330
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783540734369
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-73437-6 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c297527 _d297527