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=Theor.~Comput.~Sci. AND Volume=395
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nondeterministic polynomial time factoring in the tile assembly model
Yuriy Brun
Theoretical Computer Science
395
(1), 2008, pp. 3-23
Sequential vs. parallel complexity in simple gene assembly
Miika Langille
,
Ion Petre
Theoretical Computer Science
395
(1), 2008, pp. 24-30
Solving
NP
-complete problems in the tile assembly model
Yuriy Brun
Theoretical Computer Science
395
(1), 2008, pp. 31-46
A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class
Shile Gao
,
Kequan Ding
Theoretical Computer Science
395
(1), 2008, pp. 47-56
Modeling spiking neural networks
Ioannis D. Zaharakis
,
Achilles D. Kameas
Theoretical Computer Science
395
(1), 2008, pp. 57-76
Compositional semantics and behavioral equivalences for P systems
Roberto Barbuti
,
Andrea Maggiolo-Schettini
,
Paolo Milazzo
,
Simone Tini
Theoretical Computer Science
395
(1), 2008, pp. 77-100
Reversible computing and cellular automata - A survey
Kenichi Morita
Theoretical Computer Science
395
(1), 2008, pp. 101-131
Erratum to ``Predecessor existence problems for finite discrete dynamical systems''
Chris Barrett
,
Harry B. Hunt III
,
Madhav V. Marathe
,
S.S. Ravi
,
Daniel J. Rosenkrantz
,
Richard E. Stearns
,
Mayur Thakur
Theoretical Computer Science
395
(1), 2008, pp. 132-133
Fast profile matching algorithms - A survey
Cinzia Pizzi
,
Esko Ukkonen
Theoretical Computer Science
395
(2-3), 2008, pp. 137-157
Detection of subtle variations as consensus motifs
Matteo Comin
,
Laxmi Parida
Theoretical Computer Science
395
(2-3), 2008, pp. 158-170
A small trip in the untranquil world of genomes - A survey on the detection and analysis of genome rearrangement breakpoints
Claire Lemaitre
,
Marie-France Sagot
Theoretical Computer Science
395
(2-3), 2008, pp. 171-192
Multi-break rearrangements and chromosomal evolution
Max A. Alekseyev
,
Pavel A. Pevzner
Theoretical Computer Science
395
(2-3), 2008, pp. 193-202
On the entropy of a hidden Markov process
Philippe Jacquet
,
Gadiel Seroussi
,
Wojciech Szpankowski
Theoretical Computer Science
395
(2-3), 2008, pp. 203-219
Counting suffix arrays and strings
Klaus-Bernd Schürmann
,
Jens Stoye
Theoretical Computer Science
395
(2-3), 2008, pp. 220-234
Computation of distances for regular and context-free probabilistic languages
Mark-Jan Nederhof
,
Giorgio Satta
Theoretical Computer Science
395
(2-3), 2008, pp. 235-254
Algorithms for computing variants of the longest common subsequence problem
Costas S. Iliopoulos
,
M. Sohel Rahman
Theoretical Computer Science
395
(2-3), 2008, pp. 255-267
Computing similarity of run-length encoded strings with affine gap penalty
Jin Wook Kim
,
Amihood Amir
,
Gad M. Landau
,
Kunsoo Park
Theoretical Computer Science
395
(2-3), 2008, pp. 268-282
Approximating the 2-interval pattern problem
Maxime Crochemore
,
Danny Hermelin
,
Gad M. Landau
,
Dror Rawitz
,
Stéphane Vialette
Theoretical Computer Science
395
(2-3), 2008, pp. 283-297
Property matching and weighted matching
Amihood Amir
,
Eran Chencinski
,
Costas Iliopoulos
,
Tsvi Kopelowitz
,
Hui Zhang
Theoretical Computer Science
395
(2-3), 2008, pp. 298-310