Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Zhang, Kaizhong"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the longest common rigid subsequence problem
Nikhil Bansal
,
Moshe Lewenstein
,
Bin Ma
,
Kaizhong Zhang
Algorithmica
56
(2), 2010, pp. 270-280
Algorithms for forest pattern matching
Kaizhong Zhang
,
Yunkun Zhu
Lecture Notes in Computer Science
6129
, 2010, pp. 1-12
On the similarity metric and the distance metric
Shihyen Chen
,
Bin Ma
,
Kaizhong Zhang
Theoretical Computer Science
410
(24-25), 2009, pp. 2365-2376
Space efficient algorithms for ordered tree comparison
Lusheng Wang
,
Kaizhong Zhang
Algorithmica
51
(3), 2008, pp. 283-297
Two-dimensional range minimum queries
Amihood Amir
,
Johannes Fischer
,
Moshe Lewenstein
Lecture Notes in Computer Science
4580
, 2007, pp. 286-294
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
A Lempel-Ziv text index on secondary storage
Diego Arroyuelo
,
Gonzalo Navarro
Lecture Notes in Computer Science
4580
, 2007, pp. 83-94
Finding witnesses by peeling
Yonatan Aumann
,
Moshe Lewenstein
,
Noa Lewenstein
,
Dekel Tsur
Lecture Notes in Computer Science
4580
, 2007, pp. 28-39
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
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
Longest common separable pattern among permutations
Mathilde Bouvel
,
Dominique Rossin
,
Stéphane Vialette
Lecture Notes in Computer Science
4580
, 2007, pp. 316-327
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
Fast and practical algorithms for computing all the runs in a string
Gang Chen
,
Simon J. Puglisi
,
W.F. Smyth
Lecture Notes in Computer Science
4580
, 2007, pp. 307-315
An improved algorithm for tree edit distance incorporating structural linearity
Shihyen Chen
,
Kaizhong Zhang
Lecture Notes in Computer Science
4598
, 2007, pp. 482-492
Self-normalised distance with don't cares
Peter Clifford
,
Raphaël Clifford
Lecture Notes in Computer Science
4580
, 2007, pp. 63-70
Identification of distinguishing motifs
WangSen Feng
,
Zhanyong Wang
,
Lusheng Wang
Lecture Notes in Computer Science
4580
, 2007, pp. 253-264
Suffix arrays on words
Paolo Ferragina
,
Johannes Fischer
Lecture Notes in Computer Science
4580
, 2007, pp. 328-339
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
Move-to-front, distance coding, and inversion frequencies revisited
Travis Gagie
,
Giovanni Manzini
Lecture Notes in Computer Science
4580
, 2007, pp. 71-82
Compressed text indexes with fast locate
Rodrigo González
,
Gonzalo Navarro
Lecture Notes in Computer Science
4580
, 2007, pp. 216-227
Fixed-parameter tractability of the maximum agreement supertree problem
Sylvain Guillemot
,
Vincent Berry
Lecture Notes in Computer Science
4580
, 2007, pp. 274-285
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
Algorithms for computing the longest parameterized common subsequence
Costas S. Iliopoulos
,
Marcin Kubica
,
M. Sohel Rahman
,
Tomasz Waleń
Lecture Notes in Computer Science
4580
, 2007, pp. 265-273
A combinatorial approach to genome-wide ortholog assignment: Beyond sequence similarity search
Tao Jiang
Lecture Notes in Computer Science
4580
, 2007, pp. 1-1
Most Burrows-Wheeler based compressors are not optimal
Haim Kaplan
,
Elad Verbin
Lecture Notes in Computer Science
4580
, 2007, pp. 107-118
Seiten 1
2
3
4
>