Combinatorial Pattern Matching 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Giancarlo, Raffaele (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sankoff, David (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
Έκδοση:1st ed. 2000.
Σειρά:Lecture Notes in Computer Science, 1848
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04728nam a2200601 4500
001 978-3-540-45123-5
003 DE-He213
005 20191024111523.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 |a 9783540451235  |9 978-3-540-45123-5 
024 7 |a 10.1007/3-540-45123-4  |2 doi 
040 |d GrThAP 
050 4 |a Q337.5 
050 4 |a TK7882.P3 
072 7 |a UYQP  |2 bicssc 
072 7 |a COM016000  |2 bisacsh 
072 7 |a UYQP  |2 thema 
082 0 4 |a 006.4  |2 23 
245 1 0 |a Combinatorial Pattern Matching  |h [electronic resource] :  |b 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings /  |c edited by Raffaele Giancarlo, David Sankoff. 
250 |a 1st ed. 2000. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2000. 
300 |a XI, 426 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1848 
505 0 |a Invited 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 |a Pattern recognition. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Natural language processing (Computer science). 
650 0 |a Information storage and retrieval. 
650 0 |a Combinatorics. 
650 1 4 |a Pattern Recognition.  |0 http://scigraph.springernature.com/things/product-market-codes/I2203X 
650 2 4 |a Theory of Computation.  |0 http://scigraph.springernature.com/things/product-market-codes/I16005 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Natural Language Processing (NLP).  |0 http://scigraph.springernature.com/things/product-market-codes/I21040 
650 2 4 |a Information Storage and Retrieval.  |0 http://scigraph.springernature.com/things/product-market-codes/I18032 
650 2 4 |a Combinatorics.  |0 http://scigraph.springernature.com/things/product-market-codes/M29010 
700 1 |a Giancarlo, Raffaele.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Sankoff, David.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662201190 
776 0 8 |i Printed edition:  |z 9783540676331 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1848 
856 4 0 |u https://doi.org/10.1007/3-540-45123-4  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)