서브메뉴
검색
Combinatorial Pattern Matching
Combinatorial Pattern Matching
Detailed Information
- 자료유형
- 단행본
- ISBN
- 3-540-67633-3
- UDC
- 681.3
- DDC
- 004-23
- 청구기호
- 004 S227c
- 서명/저자
- Combinatorial Pattern Matching / Raffaele Giancarlo, David Sankoff 편.
- 발행사항
- 미국 : Springer-Verlag, 2000
- 형태사항
- 422p. ; 24cm
- 총서명
- Lecture Notes in Computer Science ; 1848
- 내용주기
- 완전내용Invited Lectures완전내용Identifying and Filtering Near-Duplicate Documents불완전내용Andrei Z. Broder부분내용1완전내용Machine Learning for Dfficient Natural-Language Processing불완전내용Fernando Pereira부분내용11완전내용Browsing around a Digital Library: Today and Tomorrow불완전내용Ian H. Witten부분내용12완전내용Sumeer School Lectures완전내용Algorthmic Aspects of Speech Recognition: A Synopsis불완전내용Adam L. Buchsbaum and Raffaele Grancarlo부분내용27완전내용Some Results on Flexible-Pattern Discovery불완전내용Larmi Parida부분내용33완전내용Contributed Papers완전내용Explaining and Controlling Ambiguity in Dynamic Programming불완전내용Robert Giegerich 46완전내용A Dynamic Edit Distane Table불완전내용Sung-Ryul Kim and Kunsoo Park부분내용6000완전내용Parametric Multiple Sequence Alinment and Phylogeny Construction불완전내용David Fernandez-Baca, Timo Seppalainen, and Giora Slutzki부분내용6911완전내용Tsukuba BB: A Branch and Dound Algorithm for Local Multiple Sequence Algnment불완전내용Paul Horton부분내용8422완전내용A Polynomial Time Approximation Scheme for the Colsest Substring Problem불완전내용BinMa부분내용9933완전내용Approximation Algrithms for Hamming Clustering Problems불완전내용Leszek Gasienice, Jesper Jansson, and Andrzej Lingas부분내용10844완전내용Approximating the Maximum Isomorphic Agreement Subtree Is Hard불완전내용Paola Bonizzoni, Gianluca Della Vedoua, and Giancarlo Mauri부분내용11955완전내용A Faster and Unifying Algorithm for Comparing Trees불완전내용Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung, and Hing-fung Ting부분내용12966완전내용Incomplete Directed Perfect Phylogeny불완전내용Itsik Pe'er, Ron Shamir, and Roded Sharan부분내용14377완전내용The Longest Common Subesquence Problem for ArciAnnotated Sequences Tao Jiang,Guo-Hui Lin, Bin Ma, and Kanzhong Zhang부분내용15488완전내용Boyer-Moore String Matching over Ziv-Lempel Compressed Pattern Matching불완전내용Yusuke Shibata, Tetsuya Matsunoto, Masayuki Takeda, Ayumi Shinohare, and Setsuo Arikawa부분내용18199완전내용Approximate String Matching over Ziv-Lempel Compressed Text불완전내용Juha Karkkainen,Gonzalo Navarro, and Esko Ukkonen부분내용19500완전내용Improving Static Compression Schemes by Alphabet Extension불완전내용Shmuel T. Klein부분내용21011완전내용Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments불완전내용Nadia El-Mabrouk부분내용22222완전내용A Lower Bound for the Breakpoint Phylogeny Problem불완전내용David Bryant부분내용23533완전내용Structural Properties and Tractablilty Results for linear Synteny불완전내용David Liben-Nowell and Jon Kleinberg부분내용24844완전내용Shift Error Detection in Standardized Exams불완전내용Steven Skiena and Pavel Sumazin부분내용26455완전내용An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice(FCC)불완전내용Rolf Backfen부분내용27766완전내용The Combinatorial Partitoning Method불완전내용Matthew R. Nelson, Sharon L. Kardia, andCharles F. Sing부분내용29377완전내용Compact Suffix Array불완전내용Veli Makinen부분내용30588완전내용Linear Bidirectional On-Line Construction of Affix Tress불완전내용Moritz G. MaaB부분내용32099완전내용Using Suffix Trees for Gapped Motif Discovery불완전내용Emily Rocke부분내용33500완전내용Indexing Text with Approximate q-Grams불완전내용Gonzalo Navarro, Erkki Sutinen Jani Tanninen, and Jorma Tarhio부분내용35011완전내용Simple Optimal String Maching Algorithm불완전내용Cyril Allauzen and Mathieu Raffinot부분내용36422완전내용Exact and Efficient Computation of the Expected Numbr of Missing and Common Words in Random Texts불완전내용Sven Rahmann and Eric Rivals부분내용37533완전내용Periods and Quasiperiods Characterization불완전내용Mireile Regnier and Lacrent Mouchard부분내용38844완전내용Finding Maximal Quasiperiodicities in Strings불완전내용Gerth SefΦlting Brodal and Christian N.S, Pedersen부분내용39755완전내용On the Complexity of Determining the Period of a String불완전내용Arthur Czumaj and Leszek Gaseniec부분내용41266완전내용Author Index부분내용42377
- 가격
- ￦57210
- Control Number
- gtec:8290
MARC
008021021s2000 us 000 eng■020 ▼a3-540-67633-3
■0801 ▼a681.3
■082 ▼a004▼223
■090 ▼a004▼bS227c
■1000 ▼aSankoff, Raffaele Giancarlo, David
■24510▼aCombinatorial Pattern Matching▼dRaffaele Giancarlo, David Sankoff 편.
■260 ▼a미국▼bSpringer-Verlag▼c2000
■300 ▼a422p.▼c24cm
■44000▼aLecture Notes in Computer Science▼v1848
■505 ▼aInvited Lectures▼aIdentifying and Filtering Near-Duplicate Documents▼bAndrei Z. Broder▼c1▼aMachine Learning for Dfficient Natural-Language Processing▼bFernando Pereira▼c11▼aBrowsing around a Digital Library: Today and Tomorrow▼bIan H. Witten▼c12▼aSumeer School Lectures▼aAlgorthmic Aspects of Speech Recognition: A Synopsis▼bAdam L. Buchsbaum and Raffaele Grancarlo▼c27▼aSome Results on Flexible-Pattern Discovery▼bLarmi Parida▼c33▼aContributed Papers▼aExplaining and Controlling Ambiguity in Dynamic Programming▼bRobert Giegerich▼d46▼aA Dynamic Edit Distane Table▼bSung-Ryul Kim and Kunsoo Park▼c6000▼aParametric Multiple Sequence Alinment and Phylogeny Construction▼bDavid Fernandez-Baca, Timo Seppalainen, and Giora Slutzki▼c6911▼aTsukuba BB: A Branch and Dound Algorithm for Local Multiple Sequence Algnment▼bPaul Horton▼c8422▼aA Polynomial Time Approximation Scheme for the Colsest Substring Problem▼bBinMa▼c9933▼aApproximation Algrithms for Hamming Clustering Problems▼bLeszek Gasienice, Jesper Jansson, and Andrzej Lingas▼c10844▼aApproximating the Maximum Isomorphic Agreement Subtree Is Hard▼bPaola Bonizzoni, Gianluca Della Vedoua, and Giancarlo Mauri▼c11955▼aA Faster and Unifying Algorithm for Comparing Trees▼bMing-Yang Kao, Tak-Wah Lam, Wing-Kin Sung, and Hing-fung Ting▼c12966▼aIncomplete Directed Perfect Phylogeny▼bItsik Pe'er, Ron Shamir, and Roded Sharan▼c14377▼aThe Longest Common Subesquence Problem for ArciAnnotated Sequences Tao Jiang,Guo-Hui Lin, Bin Ma, and Kanzhong Zhang▼c15488▼aBoyer-Moore String Matching over Ziv-Lempel Compressed Pattern Matching▼bYusuke Shibata, Tetsuya Matsunoto, Masayuki Takeda, Ayumi Shinohare, and Setsuo Arikawa▼c18199▼aApproximate String Matching over Ziv-Lempel Compressed Text▼bJuha Karkkainen,Gonzalo Navarro, and Esko Ukkonen▼c19500▼aImproving Static Compression Schemes by Alphabet Extension▼bShmuel T. Klein▼c21011▼aGenome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments▼bNadia El-Mabrouk▼c22222▼aA Lower Bound for the Breakpoint Phylogeny Problem▼bDavid Bryant▼c23533▼aStructural Properties and Tractablilty Results for linear Synteny▼bDavid Liben-Nowell and Jon Kleinberg▼c24844▼aShift Error Detection in Standardized Exams▼bSteven Skiena and Pavel Sumazin▼c26455▼aAn Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice(FCC)▼bRolf Backfen▼c27766▼aThe Combinatorial Partitoning Method▼bMatthew R. Nelson, Sharon L. Kardia, andCharles F. Sing▼c29377▼aCompact Suffix Array▼bVeli Makinen▼c30588▼aLinear Bidirectional On-Line Construction of Affix Tress▼bMoritz G. MaaB▼c32099▼aUsing Suffix Trees for Gapped Motif Discovery▼bEmily Rocke▼c33500▼aIndexing Text with Approximate q-Grams▼bGonzalo Navarro, Erkki Sutinen Jani Tanninen, and Jorma Tarhio▼c35011▼aSimple Optimal String Maching Algorithm▼bCyril Allauzen and Mathieu Raffinot▼c36422▼aExact and Efficient Computation of the Expected Numbr of Missing and Common Words in Random Texts▼bSven Rahmann and Eric Rivals▼c37533▼aPeriods and Quasiperiods Characterization▼bMireile Regnier and Lacrent Mouchard▼c38844▼aFinding Maximal Quasiperiodicities in Strings▼bGerth SefΦlting Brodal and Christian N.S, Pedersen▼c39755▼aOn the Complexity of Determining the Period of a String▼bArthur Czumaj and Leszek Gaseniec▼c41266▼aAuthor Index▼c42377
■9500 ▼b￦57210
