default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBehshad Behzadi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j4]Mohamed Ibrahim Abouelhoda, Robert Giegerich, Behshad Behzadi, Jean-Marc Steyaert:
Alignment of Minisatellite Maps Based on Run-Length Encoding Scheme. J. Bioinform. Comput. Biol. 7(2): 287-308 (2009)- [c10]Ossama Abdel Hamid, Behshad Behzadi, Stefan Christoph, Monika Henzinger:
Detecting the origin of text segments efficiently. WWW 2009: 61-70 - 2008
- [c9]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
- [c8]Behshad Behzadi, Martin Vingron:
An Improved Algorithm for the Macro-evolutionary Phylogeny Problem. CPM 2006: 177-187 - [c7]Behshad Behzadi, Martin Vingron:
Reconstructing Domain Compositions of Ancestral Multi-domain Proteins. Comparative Genomics 2006: 1-10 - 2005
- [j3]Peter Clote, Jérôme Waldispühl
, Behshad Behzadi, Jean-Marc Steyaert:
Energy landscape of k-point mutants of an RNA molecule. Bioinform. 21(22): 4140-4147 (2005) - [j2]Behshad Behzadi, Jean-Marc Steyaert:
The Transformation Distance Problem Revisited. J. Autom. Lang. Comb. 10(5/6): 577-587 (2005) - [j1]Behshad Behzadi, Jean-Marc Steyaert:
An improved algorithm for generalized comparison of minisatellites. J. Discrete Algorithms 3(2-4): 375-389 (2005) - [c6]Behshad Behzadi, Fabrice Le Fessant:
DNA Compression Challenge Revisited: A Dynamic Programming Approach. CPM 2005: 190-200 - 2004
- [c5]Behshad Behzadi, Jean-Marc Steyaert:
On the Transformation Distance Problem. SPIRE 2004: 310-320 - [c4]Behshad Behzadi, Jean-Marc Steyaert:
The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach. WABI 2004: 290-301 - 2003
- [c3]Behshad Behzadi, Jean-Marc Steyaert:
An Improved Algorithm for Generalized Comparison of Minisatellites. CPM 2003: 32-41 - [c2]Behshad Behzadi, Jean-Marc Steyaert:
The Transformation Distance Problem Revisited. Stringology 2003: 1-9 - 2002
- [c1]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
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST 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:
