2008 |
27 | EE | Mohamed Ibrahim Abouelhoda,
Robert Giegerich,
Behshad Behzadi,
Jean-Marc Steyaert:
Alignment of Minisatellite Maps: A Minimum Spanning Tree-based Approach.
APBC 2008: 261-272 |
2006 |
26 | EE | Jérôme Waldispühl,
Bonnie Berger,
Peter Clote,
Jean-Marc Steyaert:
transFold: a web server for predicting the structure and residue contacts of transmembrane beta-barrels.
Nucleic Acids Research 34(Web-Server-Issue): 189-193 (2006) |
2005 |
25 | EE | Peter Clote,
Jérôme Waldispühl,
Behshad Behzadi,
Jean-Marc Steyaert:
Energy landscape of k-point mutants of an RNA molecule.
Bioinformatics 21(22): 4140-4147 (2005) |
24 | EE | Behshad Behzadi,
Jean-Marc Steyaert:
An improved algorithm for generalized comparison of minisatellites.
J. Discrete Algorithms 3(2-4): 375-389 (2005) |
23 | | Behshad Behzadi,
Jean-Marc Steyaert:
The Transformation Distance Problem Revisited.
Journal of Automata, Languages and Combinatorics 10(5/6): 577-587 (2005) |
22 | EE | Jérôme Waldispühl,
Jean-Marc Steyaert:
Modeling and predicting all-alpha transmembrane proteins including helix-helix pairing.
Theor. Comput. Sci. 335(1): 67-92 (2005) |
2004 |
21 | EE | Behshad Behzadi,
Jean-Marc Steyaert:
On the Transformation Distance Problem.
SPIRE 2004: 310-320 |
20 | EE | Behshad Behzadi,
Jean-Marc Steyaert:
The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach.
WABI 2004: 290-301 |
2003 |
19 | EE | Behshad Behzadi,
Jean-Marc Steyaert:
An Improved Algorithm for Generalized Comparison of Minisatellites.
CPM 2003: 32-41 |
2002 |
18 | | Jérôme Waldispühl,
Behshad Behzadi,
Jean-Marc Steyaert:
An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars.
ECCB 2002: 250-259 |
2001 |
17 | EE | Gerard J. Chang,
Michel Deza,
Yannis Manoussakis,
Jean-Marc Steyaert:
Preface.
Theor. Comput. Sci. 263(1-2): 1 (2001) |
1997 |
16 | | Pierre Nicodème,
Jean-Marc Steyaert:
Selecting Optimal Oligonucleotide Primers for Multiplex PCR.
ISMB 1997: 210-213 |
1990 |
15 | | Philippe Flajolet,
Paolo Sipala,
Jean-Marc Steyaert:
Analytic Variations on the Common Subexpression Problem.
ICALP 1990: 220-234 |
14 | | María-Inés Fernández-Camacho,
Jean-Marc Steyaert:
Algebraic Simplification in Computer Algebra: An Analysis of Bottom-up Algorithms.
Theor. Comput. Sci. 74(3): 273-298 (1990) |
1989 |
13 | | Rafael Casas,
Josep Díaz,
Jean-Marc Steyaert:
Average-Case Analysis of Robinson's Unification Algorithm with Two Different Variables.
Inf. Process. Lett. 31(5): 227-232 (1989) |
1987 |
12 | | Philippe Flajolet,
Jean-Marc Steyaert:
A Complexity Calculus for Recursive Tree Algorithms.
Mathematical Systems Theory 19(4): 301-331 (1987) |
1986 |
11 | | Rafael Casas,
Jean-Marc Steyaert:
Bottom-Up Recursion in Trees.
CAAP 1986: 172-182 |
1984 |
10 | | M. Soria,
Jean-Marc Steyaert:
Average Efficiency of Pattern Matching on LISP Expressions.
CAAP 1984: 271-282 |
1983 |
9 | | Pierre Lescanne,
Jean-Marc Steyaert:
On the Study Data Structures: Binary Tournaments with Repeated Keys.
ICALP 1983: 466-477 |
8 | | Jean-Marc Steyaert,
Philippe Flajolet:
Patterns and Pattern-Matching in Trees: An Analysis
Information and Control 58(1-3): 19-58 (1983) |
1982 |
7 | | Philippe Flajolet,
Jean-Marc Steyaert:
A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization.
ICALP 1982: 239-251 |
1981 |
6 | | Philippe Flajolet,
Jean-Marc Steyaert:
A Complexity Calculus for Classes of Recursive Search Programs over Tree Structures
FOCS 1981: 386-393 |
1980 |
5 | | Philippe Flajolet,
Jean-Marc Steyaert:
On the analysis of tree-matching algorithms.
CLAAP 1980: 22-40 |
4 | | Philippe Flajolet,
Jean-Marc Steyaert:
On the Analysis of Tree-Matching Algorithms.
ICALP 1980: 208-219 |
1974 |
3 | | Philippe Flajolet,
Jean-Marc Steyaert:
On Sets Having Only Hard Subsets.
ICALP 1974: 446-457 |
1973 |
2 | | Philippe Flajolet,
Jean-Marc Steyaert:
Decision Problems for Multihead Finite Automata.
MFCS 1973: 225-230 |
1972 |
1 | | Philippe Flajolet,
Jean-Marc Steyaert:
Complexité des problèmes de décision relatifs aux algorithmes de tri.
ICALP 1972: 537-548 |