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
Hilfe
Suche: Journal=Inf.~Comput. AND Volume=213
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Domenico Cantone
,
Simone Faro
,
Emanuele Giaquinta
Information and Computation
213
, 2012, pp. 3-12
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
Thomas Schnattinger
,
Enno Ohlebusch
,
Simon Gog
Information and Computation
213
, 2012, pp. 13-22
Mod/Resc Parsimony Inference: Theory and application
Igor Nor
,
Danny Hermelin
,
Sylvain Charlat
,
Jan Engelstadter
,
Max Reuter
,
Olivier Duron
,
Marie-France Sagot
Information and Computation
213
, 2012, pp. 23-32
Phylogeny- and parsimony-based haplotype inference with constraints
Michael Elberfeld
,
Till Tantau
Information and Computation
213
, 2012, pp. 33-47
Approximate all-pairs suffix/prefix overlaps
Niko Välimäki
,
Susana Ladra
,
Veli Mäkinen
Information and Computation
213
, 2012, pp. 49-58
Optimizing restriction site placement for synthetic genomes
Pablo Montes
,
Heraldo Memelli
,
Charles B. Ward
,
Joondong Kim
,
Joseph S.B. Mitchell
,
Steven Skiena
Information and Computation
213
, 2012, pp. 59-69