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
[1]
Hilfe
Suche: Author="Giancarlo, Raffaele"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
Jérémy Barbay
,
Johannes Fischer
,
Gonzalo Navarro
Lecture Notes in Computer Science
6661
, 2011, pp. 285-298
Lightweight BWT construction for very large string collections
Markus J. Bauer
,
Anthony J. Cox
,
Giovanna Rosone
Lecture Notes in Computer Science
6661
, 2011, pp. 219-231
Substring range reporting
Philip Bille
,
Inge Li Grtz
Lecture Notes in Computer Science
6661
, 2011, pp. 299-308
Real-time streaming string-matching
Dany Breslauer
,
Zvi Galil
Lecture Notes in Computer Science
6661
, 2011, pp. 162-172
Simple real-time constant-space string matching
Dany Breslauer
,
Roberto Grossi
,
Filippo Mignosi
Lecture Notes in Computer Science
6661
, 2011, pp. 173-183
Fast error-tolerant quartet phylogeny algorithms
Daniel G. Brown
,
Jakub Truszkowski
Lecture Notes in Computer Science
6661
, 2011, pp. 147-161
Tractability and approximability of maximal strip recovery
Laurent Bulteau
,
Guillaume Fertin
,
Minghui Jiang
,
Irena Rusu
Lecture Notes in Computer Science
6661
, 2011, pp. 336-349
Efficient matching of biological sequences allowing for non-overlapping inversions
Domenico Cantone
,
Salvatore Cristofaro
,
Simone Faro
Lecture Notes in Computer Science
6661
, 2011, pp. 364-375
Tractability results for the consecutive-ones property with multiplicity
Cedric Chauve
,
Ján Man̑uch
,
Murray Patterson
,
Roland Wittler
Lecture Notes in Computer Science
6661
, 2011, pp. 90-103
Efficient seeds computation revisited
Michalis Christou
,
Maxime Crochemore
,
Costas S. Iliopoulos
,
Marcin Kubica
,
Solon P. Pissis
,
Jakub Radoszewski
,
Wojciech Rytter
,
Bartosz Szreder
,
Tomasz Waleń
Lecture Notes in Computer Science
6661
, 2011, pp. 350-363
Restricted common superstring and restricted common supersequence
Raphaël Clifford
,
Zvi Gotthilf
,
Moshe Lewenstein
,
Alexandru Popa
Lecture Notes in Computer Science
6661
, 2011, pp. 467-478
Space lower bounds for online pattern matching
Raphaël Clifford
,
Markus Jalsenius
,
Ely Porat
,
Benjamin Sach
Lecture Notes in Computer Science
6661
, 2011, pp. 184-196
Automatic discovery of patterns in media content
Nello Cristianini
Lecture Notes in Computer Science
6661
, 2011, pp. 2-13
Polynomial-time approximation algorithms for weighted LCS problem
Marek Cygan
,
Marcin Kubica
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Waleń
Lecture Notes in Computer Science
6661
, 2011, pp. 455-466
String comparison and Lyndon-like factorization using V-order in linear time
David E. Daykin
,
Jacqueline W. Daykin
,
W.F. Smyth
Lecture Notes in Computer Science
6661
, 2011, pp. 65-76
A
d
-step approach for distinct squares in strings
Antoine Deza
,
Frantisek Franek
,
Mei Jiang
Lecture Notes in Computer Science
6661
, 2011, pp. 77-89
Finding approximate and constrained motifs in graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Lecture Notes in Computer Science
6661
, 2011, pp. 388-401
Approximation algorithms for orienting mixed graphs
Michael Elberfeld
,
Danny Segev
,
Colin R. Davidson
,
Dana Silverbush
,
Roded Sharan
Lecture Notes in Computer Science
6661
, 2011, pp. 416-428
On the weak prefix-search problem
Paolo Ferragina
Lecture Notes in Computer Science
6661
, 2011, pp. 261-272
Counting colours in compressed strings
Travis Gagie
,
Juha Kärkkäinen
Lecture Notes in Computer Science
6661
, 2011, pp. 197-207
Quick greedy computation for minimum common string partitions
Isaac Goldstein
,
Moshe Lewenstein
Lecture Notes in Computer Science
6661
, 2011, pp. 273-284
Frequent submap discovery
Stéphane Gosselin
,
Guillaume Damiand
,
Christine Solnon
Lecture Notes in Computer Science
6661
, 2011, pp. 429-440
Unique perfect phylogeny is
NP
-hard
Michel Habib
,
Juraj Stacho
Lecture Notes in Computer Science
6661
, 2011, pp. 132-146
Improved MAX SNP-hard results for finding an edit distance between unordered trees
Kouichi Hirata
,
Yoshiyuki Yamamoto
,
Tetsuji Kuboyama
Lecture Notes in Computer Science
6661
, 2011, pp. 402-415
Palindrome pattern matching
Tomohiro I
,
Shunsuke Inenaga
,
Masayuki Takeda
Lecture Notes in Computer Science
6661
, 2011, pp. 232-245
Seiten 1
2
3
4
5
>