 | 2009 |
|---|
| 13 |       | Ossama Abdel Hamid,
Behshad Behzadi,
Stefan Christoph,
Monika Rauch Henzinger:
Detecting the origin of text segments efficiently.
WWW 2009: 61-70 |
| 12 | | Mohamed Ibrahim Abouelhoda,
Robert Giegerich,
Behshad Behzadi,
Jean-Marc Steyaert:
Alignment of Minisatellite Maps Based on Run-Length Encoding Scheme.
J. Bioinformatics and Computational Biology 7(2): 287-308 (2009) |
| 2008 |
|---|
| 11 | | 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 |
|---|
| 10 | | Behshad Behzadi,
Martin Vingron:
An Improved Algorithm for the Macro-evolutionary Phylogeny Problem.
CPM 2006: 177-187 |
| 9 | | Behshad Behzadi,
Martin Vingron:
Reconstructing Domain Compositions of Ancestral Multi-domain Proteins.
Comparative Genomics 2006: 1-10 |
| 2005 |
|---|
| 8 | | Behshad Behzadi,
Fabrice Le Fessant:
DNA Compression Challenge Revisited: A Dynamic Programming Approach.
CPM 2005: 190-200 |
| 7 | | 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) |
| 6 | | Behshad Behzadi,
Jean-Marc Steyaert:
An improved algorithm for generalized comparison of minisatellites.
J. Discrete Algorithms 3(2-4): 375-389 (2005) |
| 5 |  | Behshad Behzadi,
Jean-Marc Steyaert:
The Transformation Distance Problem Revisited.
Journal of Automata, Languages and Combinatorics 10(5/6): 577-587 (2005) |
| 2004 |
|---|
| 4 | | Behshad Behzadi,
Jean-Marc Steyaert:
On the Transformation Distance Problem.
SPIRE 2004: 310-320 |
| 3 | | Behshad Behzadi,
Jean-Marc Steyaert:
The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach.
WABI 2004: 290-301 |
| 2003 |
|---|
| 2 | | Behshad Behzadi,
Jean-Marc Steyaert:
An Improved Algorithm for Generalized Comparison of Minisatellites.
CPM 2003: 32-41 |
| 2002 |
|---|
| 1 | | 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 |
