Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=6129

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Algorithms for forest pattern matching
Kaizhong Zhang, Yunkun Zhu
Lecture Notes in Computer Science 6129, 2010, pp. 1-12
Affine image matching is uniform TC^0-complete
Christian Hundt
Lecture Notes in Computer Science 6129, 2010, pp. 13-25
Old and new in stringology
Zvi Galil
Lecture Notes in Computer Science 6129, 2010, pp. 26-26
Small-space 2D compressed dictionary matching
Shoshana Neuburger, Dina Sokol
Lecture Notes in Computer Science 6129, 2010, pp. 27-39
Bidirectional search in a string with wavelet trees
Thomas Schnattinger, Enno Ohlebusch, Simon Gog
Lecture Notes in Computer Science 6129, 2010, pp. 40-50
A minimal periods algorithm with applications
Zhi Xu
Lecture Notes in Computer Science 6129, 2010, pp. 51-62
The property suffix tree with dynamic properties
Tsvi Kopelowitz
Lecture Notes in Computer Science 6129, 2010, pp. 63-75
Approximate all-pairs suffix/prefix overlaps
Niko Välimäki, Susana Ladra, Veli Mäkinen
Lecture Notes in Computer Science 6129, 2010, pp. 76-87
Succinct dictionary matching with no slowdown
Djamal Belazzougui
Lecture Notes in Computer Science 6129, 2010, pp. 88-100
Pseudo-realtime pattern matching: Closing the gap
Raphaël Clifford, Benjamin Sach
Lecture Notes in Computer Science 6129, 2010, pp. 101-111
Breakpoint distance and PQ-trees
Haitao Jiang, Cedric Chauve, Binhai Zhu
Lecture Notes in Computer Science 6129, 2010, pp. 112-124
On the parameterized complexity of some optimization problems related to multiple-interval graphs
Minghui Jiang
Lecture Notes in Computer Science 6129, 2010, pp. 125-137
Succinct representations of separable graphs
Guy E. Blelloch, Arash Farzan
Lecture Notes in Computer Science 6129, 2010, pp. 138-150
Implicit hitting set problems and multi-genome alignment
Richard M. Karp
Lecture Notes in Computer Science 6129, 2010, pp. 151-151
Bounds on the minimum mosaic of population sequences under recombination
Yufeng Wu
Lecture Notes in Computer Science 6129, 2010, pp. 152-163
The highest expected reward decoding for HMMs with application to recombination detection
Michal Nánási, Tomás̑ Vinaȓ, Bron̑a Brejová
Lecture Notes in Computer Science 6129, 2010, pp. 164-176
Phylogeny- and parsimony-based haplotype inference with constraints
Michael Elberfeld, Till Tantau
Lecture Notes in Computer Science 6129, 2010, pp. 177-189
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
Lecture Notes in Computer Science 6129, 2010, pp. 190-201
Mod/Resc Parsimony Inference
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot
Lecture Notes in Computer Science 6129, 2010, pp. 202-213
Extended islands of tractability for parsimony haplotyping
Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu
Lecture Notes in Computer Science 6129, 2010, pp. 214-226
Sampled longest common prefix array
Jouni Sirén
Lecture Notes in Computer Science 6129, 2010, pp. 227-237
Verifying a parameterized border array in O(n^{1.5}) time
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Lecture Notes in Computer Science 6129, 2010, pp. 238-250
Cover array string reconstruction
Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler
Lecture Notes in Computer Science 6129, 2010, pp. 251-259
Compression, indexing, and retrieval for massive string data
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
Lecture Notes in Computer Science 6129, 2010, pp. 260-274
Building the minimal automaton of A^*X in linear time, when X is of bounded cardinality
Omar AitMous, Frédérique Bassino, Cyril Nicaud
Lecture Notes in Computer Science 6129, 2010, pp. 275-287

Seiten 1 2 >