Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5029

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

ReCombinatorics: Combinatorial algorithms for studying the history of recombination in populations
Dan Gusfield
Lecture Notes in Computer Science 5029, 2008, pp. 1-2
Lower bounds for succinct data structures
J. Ian Munro
Lecture Notes in Computer Science 5029, 2008, pp. 3-3
The changing face of web search
Prabhakar Raghavan
Lecture Notes in Computer Science 5029, 2008, pp. 4-4
Two-dimensional pattern matching with combined scaling and rotation
Christian Hundt, Maciej Liśkiewicz
Lecture Notes in Computer Science 5029, 2008, pp. 5-17
Searching for gapped palindromes
Roman Kolpakov, Gregory Kucherov
Lecture Notes in Computer Science 5029, 2008, pp. 18-30
Parameterized algorithms and hardness results for some graph motif problems
Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
Lecture Notes in Computer Science 5029, 2008, pp. 31-43
Finding largest well-predicted subset of protein structure models
Shuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li
Lecture Notes in Computer Science 5029, 2008, pp. 44-55
HP distance via double cut and join distance
Anne Bergeron, Julia Mixtacki, Jens Stoye
Lecture Notes in Computer Science 5029, 2008, pp. 56-68
Fixed parameter tractable alignment of RNA structures including arbitrary pseudoknots
Mathias Möhl, Sebastian Will, Rolf Backofen
Lecture Notes in Computer Science 5029, 2008, pp. 69-81
Faster algorithm for the set variant of the string barcoding problem
Leszek Ga̧sieniec, Cindy Y. Li, Meng Zhang
Lecture Notes in Computer Science 5029, 2008, pp. 82-94
Probabilistic arithmetic automata and their application to pattern matching statistics
Tobias Marschall, Sven Rahmann
Lecture Notes in Computer Science 5029, 2008, pp. 95-106
Analysis of the size of antidictionary in DCA
Julien Fayolle
Lecture Notes in Computer Science 5029, 2008, pp. 107-117
Approximate string matching with address bit errors
Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
Lecture Notes in Computer Science 5029, 2008, pp. 118-129
On-line approximate string matching with bounded errors
Marcos Kiwi, Gonzalo Navarro, Claudio Telha
Lecture Notes in Computer Science 5029, 2008, pp. 130-142
A black box for online approximate pattern matching
Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat
Lecture Notes in Computer Science 5029, 2008, pp. 143-151
An(other) entropy-bounded compressed suffix tree
Johannes Fischer, Veli Mäkinen, Gonzalo Navarro
Lecture Notes in Computer Science 5029, 2008, pp. 152-165
On compact representations of all-pairs-shortest-path-distance matrices
Igor Nitto, Rossano Venturini
Lecture Notes in Computer Science 5029, 2008, pp. 166-177
Computing inverse ST in linear complexity
Ge Nong, Sen Zhang, Wai Hong Chan
Lecture Notes in Computer Science 5029, 2008, pp. 178-190
Dynamic fully-compressed suffix trees
Luís M.S. Russo, Gonzalo Navarro, Arlindo Oliveira
Lecture Notes in Computer Science 5029, 2008, pp. 191-203
A linear delay algorithm for building concept lattices
Martin Farach-Colton, Yang Huang
Lecture Notes in Computer Science 5029, 2008, pp. 204-216
Matching integer intervals by minimal sets of binary words with don't cares
Wojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani
Lecture Notes in Computer Science 5029, 2008, pp. 217-229
Fast algorithms for computing tree LCS
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
Lecture Notes in Computer Science 5029, 2008, pp. 230-243
Why greed works for shortest common superstring problem
Bin Ma
Lecture Notes in Computer Science 5029, 2008, pp. 244-254
Constrained LCS: Hardness and approximation
Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein
Lecture Notes in Computer Science 5029, 2008, pp. 255-262
Finding additive biclusters with random background
Jing Xiao, Lusheng Wang, Xiaowen Liu, Tao Jiang
Lecture Notes in Computer Science 5029, 2008, pp. 263-276

Seiten 1 2 >