Behshad Behzadi

According to our database, Behshad Behzadi authored at least 12 papers between 2002 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Alignment of Minisatellite Maps Based on Run-Length Encoding Scheme.

Mohamed Ibrahim Abouelhoda, Robert Giegerich, Behshad Behzadi, Jean-Marc Steyaert

J. Bioinform. Comput. Biol., 2009

Detecting the origin of text segments efficiently.

Ossama Abdel Hamid, Behshad Behzadi, Stefan Christoph, Monika Henzinger

Proceedings of the 18th International Conference on World Wide Web, 2009

2008

Alignment of Minisatellite Maps: A Minimum Spanning Tree-based Approach.

Mohamed Ibrahim Abouelhoda, Robert Giegerich, Behshad Behzadi, Jean-Marc Steyaert

Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2006

Reconstructing Domain Compositions of Ancestral Multi-domain Proteins.

Behshad Behzadi, Martin Vingron

Proceedings of the Comparative Genomics, 2006

An Improved Algorithm for the Macro-evolutionary Phylogeny Problem.

Behshad Behzadi, Martin Vingron

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

An improved algorithm for generalized comparison of minisatellites.

Behshad Behzadi, Jean-Marc Steyaert

J. Discrete Algorithms, 2005

The Transformation Distance Problem Revisited.

Behshad Behzadi, Jean-Marc Steyaert

J. Autom. Lang. Comb., 2005

Energy landscape of <i>k</i>-point mutants of an RNA molecule.

Peter Clote, Jérôme Waldispühl, Behshad Behzadi, Jean-Marc Steyaert

Bioinform., 2005

DNA Compression Challenge Revisited: A Dynamic Programming Approach.

Behshad Behzadi, Fabrice Le Fessant

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004

The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach.

Behshad Behzadi, Jean-Marc Steyaert

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

On the Transformation Distance Problem.

Behshad Behzadi, Jean-Marc Steyaert

Proceedings of the String Processing and Information Retrieval, 2004

2002

An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars.

Jérôme Waldispühl, Behshad Behzadi, Jean-Marc Steyaert

Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002