Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4580

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

A combinatorial approach to genome-wide ortholog assignment: Beyond sequence similarity search
Tao Jiang
Lecture Notes in Computer Science 4580, 2007, pp. 1-1
Stringology: Some classic and some modern problems
S. Muthukrishnan
Lecture Notes in Computer Science 4580, 2007, pp. 2-2
Algorithmic problems in scheduling jobs on variable-speed processors
Frances F. Yao
Lecture Notes in Computer Science 4580, 2007, pp. 3-3
Speeding up HMM decoding and training by exploiting sequence repetitions
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
Lecture Notes in Computer Science 4580, 2007, pp. 4-15
On demand string sorting over unbounded alphabets
Carmel Kent, Moshe Lewenstein, Dafna Sheinwald
Lecture Notes in Computer Science 4580, 2007, pp. 16-27
Finding witnesses by peeling
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Lecture Notes in Computer Science 4580, 2007, pp. 28-39
Cache-oblivious index for approximate string matching
Wing-Kai Hon, Tak-Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Vitter
Lecture Notes in Computer Science 4580, 2007, pp. 40-51
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
Philip Bille, Rolf Fagerberg, Inge Li Grtz
Lecture Notes in Computer Science 4580, 2007, pp. 52-62
Self-normalised distance with don't cares
Peter Clifford, Raphaël Clifford
Lecture Notes in Computer Science 4580, 2007, pp. 63-70
Move-to-front, distance coding, and inversion frequencies revisited
Travis Gagie, Giovanni Manzini
Lecture Notes in Computer Science 4580, 2007, pp. 71-82
A Lempel-Ziv text index on secondary storage
Diego Arroyuelo, Gonzalo Navarro
Lecture Notes in Computer Science 4580, 2007, pp. 83-94
Dynamic rank-select structures with applications to run-length encoded texts
Sunho Lee, Kunsoo Park
Lecture Notes in Computer Science 4580, 2007, pp. 95-106
Most Burrows-Wheeler based compressors are not optimal
Haim Kaplan, Elad Verbin
Lecture Notes in Computer Science 4580, 2007, pp. 107-118
Non-breaking similarity of genomes with gene repetitions
Zhixiang Chen, Bin Fu, Jinhui Xu, Boting Yang, Zhiyu Zhao, Binhai Zhu
Lecture Notes in Computer Science 4580, 2007, pp. 119-130
A new and faster method of sorting by transpositions
Maxime Benoît-Gagné, Sylvie Hamel
Lecture Notes in Computer Science 4580, 2007, pp. 131-141
Finding compact structural motifs
Jianbo Qian, Shuai Li, Dongbo Bu, Ming Li, Jinbo Xu
Lecture Notes in Computer Science 4580, 2007, pp. 142-149
Improved algorithms for inferring the minimum mosaic of a set of recombinants
Yufeng Wu, Dan Gusfield
Lecture Notes in Computer Science 4580, 2007, pp. 150-161
Computing exact p-value for structured motif
Jing Zhang, Xi Chen, Ming Li
Lecture Notes in Computer Science 4580, 2007, pp. 162-172
Improved sketching of Hamming distance with error correcting
Ely Porat, Ohad Lipsky
Lecture Notes in Computer Science 4580, 2007, pp. 173-182
Deterministic length reduction: Fast convolution in sparse data and applications
Amihood Amir, Oren Kapah, Ely Porat
Lecture Notes in Computer Science 4580, 2007, pp. 183-194
Guided forest edit distance: Better structure comparisons by using domain-knowledge
Zeshan Peng, Hing-fung Ting
Lecture Notes in Computer Science 4580, 2007, pp. 195-204
Space-efficient algorithms for document retrieval
Niko Välimäki, Veli Mäkinen
Lecture Notes in Computer Science 4580, 2007, pp. 205-215
Compressed text indexes with fast locate
Rodrigo González, Gonzalo Navarro
Lecture Notes in Computer Science 4580, 2007, pp. 216-227
Processing compressed texts: A tractability border
Yury Lifshits
Lecture Notes in Computer Science 4580, 2007, pp. 228-240
Common structured patterns in linear graphs: Approximation and combinatorics
Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
Lecture Notes in Computer Science 4580, 2007, pp. 241-252

Seiten 1 2 >