close
1.

図書

図書
Alberto Apostolico, Masayuki Takeda (eds.)
出版情報: Berlin : Springer, c2002  viii, 288 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2373
所蔵情報: loading…
2.

図書

図書
Amihood Amir, Gad M. Landau (eds.)
出版情報: Berlin : Springer, c2001  viii, 271 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2089
所蔵情報: loading…
目次情報: 続きを見る
Regular Expression Searching over Ziv-Lempel Compressed Text / Gonzalo Navarro
Parallel Lempel Ziv Coding (Extended Abstract) / Shmuel Tomi Klein ; Yair Wiseman
Approximate Matching of Run-Length Compressed Strings / Veli Mäkinen ; Esko Ukkonen
What to Do with All this Hardware? (Invited Lecture) / Uzi Vishkin
Efficient Experimental String Matching by Weak Factor Recognition / Cyril Allauzen ; Maxime Crochemore ; Mathieu Raffinot
Better Filtering with Gapped q-Grams / Stefan Burkhardt ; Juha Kärkkäinen
Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) / Abraham Bookstein ; Timo Raita
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) / Aviezri S. Fraenkel ; Jamie Simpson
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory / Anne Bergeron
Tandem Cyclic Alignment / Gary Benson
An Output-Sensitive Flexible Pattern Discovery Algorithm / Laxmi Parida ; Isidore Rigoutsos ; Dan Platt
Episode Matching / Zdenek Tronícek
String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music / Masayuki Takeda
Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) / Hiroki Arimura ; Hiroki Asaka ; Hiroshi Sakamoto ; Setsuo Arikawa
On-Line Construction of Compact Directed Acyclic Word Graphs / Jean-Marc Champarnaud ; Djelloul Ziadi ; Shunsuke Inenaga ; Hiromasa Hoshino ; Ayumi Shinohara ; Giancarlo Mauri ; Giulio Pavesi
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications / Toru Kasai ; Gunho Lee ; Kunsoo Park
Multiple Pattern Matching Algorithms on Collage System / Takuya Kida ; Tetsuya Matsumoto
Finding All Common Intervals of k Permutations / Steffen Heber ; Jens Stoye
Generalized Pattern Matching and the Complexity of Unavoidability Testing / Christine E. Heitsch
Balanced Suffix Trees (Invited Lecture) / S. Rao Kosaraju
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees / Jesper Jansson ; Andrzej Lingas
Minimum Quartet Inconsistency Is Fixed Parameter Tractable / Jens Gramm ; Rolf Niedermeier
Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC / Rolf Backofen ; Sebastian Will
Author Index
Regular Expression Searching over Ziv-Lempel Compressed Text / Gonzalo Navarro
Parallel Lempel Ziv Coding (Extended Abstract) / Shmuel Tomi Klein ; Yair Wiseman
Approximate Matching of Run-Length Compressed Strings / Veli Mäkinen ; Esko Ukkonen
3.

図書

図書
Alberto Apostolico, Maxime Crochemore, Kunsoo Park (eds.)
出版情報: Berlin : Springer, c2005  xi, 444 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3537
所蔵情報: loading…
4.

図書

図書
Martin Farach-Colton (ed.)
出版情報: Berlin : Springer, c1998  viii, 250 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1448
所蔵情報: loading…
5.

図書

図書
Suleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusoz (eds.)
出版情報: Berlin ; Tokyo : Springer, c2004  xi, 486 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3109
所蔵情報: loading…
6.

図書

図書
Maxime Crochemore, Mike Paterson (eds.)
出版情報: Berlin ; Tokyo : Springer, c1999  viii, 293 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1645
所蔵情報: loading…
7.

図書

図書
Raffaele Giancarlo, David Sankoff (eds.)
出版情報: Berlin : Springer, c2000  xi, 422 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1848
所蔵情報: loading…
目次情報: 続きを見る
Invited Lectures
Identifying and Filtering Near-Duplicate Documents / Andrei Z. Broder
Machine Learning for Efficient Natural-Language Processing / Fernando Pereira
Browsing around a Digital Library: Today and Tomorrow / Ian H. Witten
Summer School Lectures
Algorithmic Aspects of Speech Recognition: A Synopsis / Adam L. Buchsbaum ; Raffaele Giancarlo
Some Results on Flexible-Pattern Discovery / Laxmi Parida
Contributed Papers
Explaining and Controlling Ambiguity in Dynamic Programming / Robert Giegerich
A Dynamic Edit Distance Table / Sung-Ryul Kim ; Kunsoo Park
Parametric Multiple Sequence Alignment and Phylogeny Construction / David Fernández-Baca ; Timo Seppäläinen ; Giora Slutzki
Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment / Paul Horton
A Polynomial Time Approximation Scheme for the Closest Substring Problem / Bin Ma
Approximation Algorithms for Hamming Clustering Problems / Leszek Gasieniec ; Jesper Jansson ; Andrzej Lingas
Approximating the Maximum Isomorphic Agreement Subtree Is Hard / Paola Bonizzoni ; Gianluca Della Vedova ; Giancarlo Mauri
A Faster and Unifying Algorithm for Comparing Trees / Ming-Yang Kao ; Tak-Wah Lam ; Wing-Kin Sung ; Hing-Fung Ting
Incomplete Directed Perfect Phylogeny / Itsik Pe'er ; Ron Shamir ; Roded Sharan
The Longest Common Subsequence Problem for Arc-Annotated Sequences / Tao Jiang ; Guo-Hui Lin ; Kaizhong Zhang
Boyer-Moore String Matching over Ziv-Lempel Compressed Text / Gonzalo Navarro ; Jorma Tarhio
A Boyer-Moore Type Algorithm for Compressed Pattern Matching / Yusuke Shibata ; Tetsuya Matsumoto ; Masayuki Takeda ; Ayumi Shinohara ; Setsuo Arikawa
Approximate String Matching over Ziv-Lempel Compressed Text / Juha Kärkkäinen ; Esko Ukkonen
Improving Static Compression Schemes by Alphabet Extension / Shmuel T. Klein
Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments / Nadia El-Mabrouk
A Lower Bound for the Breakpoint Phylogeny Problem / David Bryant
Structural Properties and Tractability Results for Linear Synteny / David Liben-Nowell ; Jon Kleinberg
Shift Error Detection in Standardized Exams / Steven Skiena ; Pavel Sumazin
An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) / Rolf Backofen
The Combinatorial Partitioning Method / Matthew R. Nelson ; Sharon L. Kardia ; Charles F. Sing
Compact Suffix Array / Veli Mäkinen
Linear Bidirectional On-Line Construction of Affix Trees / Moritz G. Maaß
Using Suffix Trees for Gapped Motif Discovery / Emily Rocke
Indexing Text with Approximate q-Grams / Erkki Sutinen ; Jani Tanninen
Simple Optimal String Matching Algorithm / Cyril Allauzen ; Mathieu Raffinot
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts / Sven Rahmann ; Eric Rivals
Periods and Quasiperiods Characterization / Mireille Régnier ; Laurent Mouchard
Finding Maximal Quasiperiodicities in Strings / Gerth Stølting Brodal ; Christian N.S. Pedersen
On the Complexity of Determining the Period of a String / Arthur Czumaj
Author Index
Invited Lectures
Identifying and Filtering Near-Duplicate Documents / Andrei Z. Broder
Machine Learning for Efficient Natural-Language Processing / Fernando Pereira
8.

図書

図書
Ricardo Baeza-Yates, Edgar Chávez, Maxime Crochemore (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xi, 401 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2676
所蔵情報: loading…
9.

図書

図書
Alberto Apostolico, Jotun Hein (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer-Verlag, c1997  viii, 274 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1264
所蔵情報: loading…
10.

図書

図書
Dan Hirschberg, Gene Myers, (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  viii, 391 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1075
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼