Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Behshad Behzadi

dblp:52/150 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
text analysis
0.112009
Detecting the origin of text segments efficiently · WWW 2009
Information retrieval › document processing › document analysis
text reuse detection
0.112009
Detecting the origin of text segments efficiently · WWW 2009
Algorithms and data structures › sequence algorithms
string algorithms
0.112009
Detecting the origin of text segments efficiently · WWW 2009
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics › RNA structure prediction
RNA secondary structure prediction
0.112005
Energy landscape of k-point mutants of an RNA molecule · Bioinform. 2005
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics
RNA structure analysis
0.112005
Energy landscape of k-point mutants of an RNA molecule · Bioinform. 2005
Information retrieval › similarity measure
document similarity
0.012009
Detecting the origin of text segments efficiently · WWW 2009
Information retrieval
search engines
0.012009
Detecting the origin of text segments efficiently · WWW 2009

Methods — techniques the papers use, named apart from their topics

fixed-memory algorithms · 0.2estimation techniques · 0.2AMSAG algorithm · 0.1
YearPublicationVenuePosition
2009 Detecting the origin of text segments efficiently
abstract
In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of k alphanumeric terms in D the earliest document in $S$ in which the sequence appeared (if such a document exists). Algorithms for the origin detection problem can, for example, be used to detect the "origin" of text segments in D and thus to detect novel content in D. They can also find the document from which the author of D has copied the most (or show that D is mostly original.) We concentrate on solutions that use only a fixed amount of memory. We propose novel algorithms for this problem and evaluate them together with a large number of previously published algorithms. Our results show that (1) detecting the origin of text segments efficiently can be done with very high accuracy even when the space used is less than 1% of the size of the documents in $S$, (2) the precision degrades smoothly with the amount of available space, (3) various estimation techniques can be used to increase the performance of the algorithms.
Ossama Abdel Hamid, Behshad Behzadi, Stefan Christoph, Monika Henzinger
WWW2
2008 Alignment of Minisatellite Maps: A Minimum Spanning Tree-based Approach
Mohamed Ibrahim Abouelhoda, Robert Giegerich, Behshad Behzadi, Jean-Marc Steyaert
APBC3
2006 An Improved Algorithm for the Macro-evolutionary Phylogeny Problem
Behshad Behzadi, Martin Vingron
CPM1
2005 DNA Compression Challenge Revisited: A Dynamic Programming Approach
Behshad Behzadi, Fabrice Le Fessant
CPM1
2005 Energy landscape of k-point mutants of an RNA molecule
abstract
MOTIVATION: A k-point mutant of a given RNA sequence s = s(1), ..., s(n) is an RNA sequence s' = s'(1),..., s'(n) obtained by mutating exactly k-positions in s; i.e. Hamming distance between s and s' equals k. To understand the effect of pointwise mutation in RNA, we consider the distribution of energies of all secondary structures of k-point mutants of a given RNA sequence. RESULTS: Here we describe a novel algorithm to compute the mean and standard deviation of energies of all secondary structures of k-point mutants of a given RNA sequence. We then focus on the tail of the energy distribution and compute, using the algorithm AMSAG, the k-superoptimal structure; i.e. the secondary structure of a < or =k-point mutant having least free energy over all secondary structures of all k'-point mutants of a given RNA sequence, for k' < or = k. Evidence is presented that the k-superoptimal secondary structure is often closer, as measured by base pair distance and two additional distance measures, to the secondary structure derived by comparative sequence analysis than that derived by the Zuker minimum free energy structure of the original (wild type or unmutated) RNA.
Peter Clote, Jérôme Waldispühl, Behshad Behzadi, Jean-Marc Steyaert
Bioinform.3
2004 On the Transformation Distance Problem
Behshad Behzadi, Jean-Marc Steyaert
SPIRE1
2004 The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach
Behshad Behzadi, Jean-Marc Steyaert
WABI1
2003 An Improved Algorithm for Generalized Comparison of Minisatellites
Behshad Behzadi, Jean-Marc Steyaert
CPM1