default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 395
Volume 395, Number 1, April 2008
- Grzegorz Rozenberg:
Preface. 1-2
- Yuriy Brun
:
Nondeterministic polynomial time factoring in the tile assembly model. 3-23 - Miika Langille, Ion Petre:
Sequential vs. parallel complexity in simple gene assembly. 24-30 - Yuriy Brun:
Solving NP-complete problems in the tile assembly model. 31-46 - Shile Gao, Kequan Ding:
A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class. 47-56 - Ioannis D. Zaharakis, Achilles D. Kameas:
Modeling spiking neural networks. 57-76 - Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
Compositional semantics and behavioral equivalences for P Systems. 77-100 - Kenichi Morita:
Reversible computing and cellular automata - A survey. 101-131
- Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur:
Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]. 132-133
Volume 395, Numbers 2-3, May 2008
- Raffaele Giancarlo, Stefano Lonardi:
Foreword: Special issue in honor of the 60th Birthday of Professor Alberto Apostolico: Work is for people who do not know how to: SAIL - String Algorithms, Information and Learning. 135-136
- Cinzia Pizzi, Esko Ukkonen:
Fast profile matching algorithms - A survey. 137-157 - Matteo Comin, Laxmi Parida:
Detection of subtle variations as consensus motifs. 158-170 - Claire Lemaitre, Marie-France Sagot:
A small trip in the untranquil world of genomes: A survey on the detection and analysis of genome rearrangement breakpoints. 171-192 - Max A. Alekseyev, Pavel A. Pevzner:
Multi-break rearrangements and chromosomal evolution. 193-202 - Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski:
On the entropy of a hidden Markov process. 203-219 - Klaus-Bernd Schürmann, Jens Stoye:
Counting suffix arrays and strings. 220-234 - Mark-Jan Nederhof, Giorgio Satta:
Computation of distances for regular and context-free probabilistic languages. 235-254 - Costas S. Iliopoulos, M. Sohel Rahman:
Algorithms for computing variants of the longest common subsequence problem. 255-267 - Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Computing similarity of run-length encoded strings with affine gap penalty. 268-282 - Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette:
Approximating the 2-interval pattern problem. 283-297 - Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang:
Property matching and weighted matching. 298-310
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
