Demo Data from EDBT 2026 / reviewers in the wild / expert
Mounir Errami
dblp:30/453
· DBLP profile ↗
6ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 6 · 3 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.
| Interdisciplinary, comprehensive, and emerging computing
4 papers |
Bioinformatics and computational biology · 93% Computational social science and digital humanities · 7% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › document retrieval › domain-specific retrieval
biomedical information retrieval |
0.1 | 1 | 2006 | Text similarity: an alternative way to search MEDLINE · Bioinform. 2006 |
Information retrieval › document retrieval
literature search |
0.1 | 1 | 2006 | Text similarity: an alternative way to search MEDLINE · Bioinform. 2006 |
Information retrieval › document retrieval › domain-specific retrieval › biomedical information retrieval
MEDLINE search |
0.1 | 1 | 2006 | Text similarity: an alternative way to search MEDLINE · Bioinform. 2006 |
Bioinformatics and computational biology › structural bioinformatics › protein structure representation
protein structure visualization |
0.1 | 1 | 2005 | Friend, an integrated analytical front-end application for bioinformatics · Bioinform. 2005 |
Bioinformatics and computational biology
structural bioinformatics |
0.1 | 1 | 2005 | Friend, an integrated analytical front-end application for bioinformatics · Bioinform. 2005 |
Bioinformatics and computational biology
multiple sequence alignment |
0.0 | 1 | 2003 | Detection of unrelated proteins in sequences multiple alignments by using predicted secondary structures · Bioinform. 2003 |
Bioinformatics and computational biology
protein sequence analysis |
0.0 | 1 | 2003 | Detection of unrelated proteins in sequences multiple alignments by using predicted secondary structures · Bioinform. 2003 |
Computational social science and digital humanities › text analysis
plagiarism detection |
0.0 | 1 | 2010 | Identifying duplicate content using statistically improbable phrases · Bioinform. 2010 |
Bioinformatics and computational biology
sequence analysis |
0.0 | 1 | 2005 | Friend, an integrated analytical front-end application for bioinformatics · Bioinform. 2005 |
Bioinformatics and computational biology › protein structure prediction
secondary structure prediction |
0.0 | 1 | 2003 | Detection of unrelated proteins in sequences multiple alignments by using predicted secondary structures · Bioinform. 2003 |
Methods — techniques the papers use, named apart from their topics
statistically improbable phrases · 0.1text similarity · 0.1weighted keyword-based search · 0.1sentence-alignment similarity · 0.1structural alignment · 0.1secondary structure prediction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Identifying duplicate content using statistically improbable phrasesabstractMOTIVATION: Document similarity metrics such as PubMed's 'Find related articles' feature, which have been primarily used to identify studies with similar topics, can now also be used to detect duplicated or potentially plagiarized papers within literature reference databases. However, the CPU-intensive nature of document comparison has limited MEDLINE text similarity studies to the comparison of abstracts, which constitute only a small fraction of a publication's total text. Extending searches to include text archived by online search engines would drastically increase comparison ability. For large-scale studies, submitting short phrases encased in direct quotes to search engines for exact matches would be optimal for both individual queries and programmatic interfaces. We have derived a method of analyzing statistically improbable phrases (SIPs) for assistance in identifying duplicate content. RESULTS: When applied to MEDLINE citations, this method substantially improves upon previous algorithms in the detection of duplication citations, yielding a precision and recall of 78.9% (versus 50.3% for eTBLAST) and 99.6% (versus 99.8% for eTBLAST), respectively. AVAILABILITY: Similar citations identified by this work are freely accessible in the Déjà vu database, under the SIP discovery method category at http://dejavu.vbi.vt.edu/dejavu/. Mounir Errami, Zhaohui Sun, Angela C. George, Tara C. Long, Michael A. Skinner, Jonathan D. Wren, Harold R. Garner |
Bioinform. | 1 |
| 2008 | Déjà vu - A study of duplicate citations in MedlineabstractMOTIVATION: Duplicate publication impacts the quality of the scientific corpus, has been difficult to detect, and studies this far have been limited in scope and size. Using text similarity searches, we were able to identify signatures of duplicate citations among a body of abstracts. RESULTS: A sample of 62,213 Medline citations was examined and a database of manually verified duplicate citations was created to study author publication behavior. We found that 0.04% of the citations with no shared authors were highly similar and are thus potential cases of plagiarism. 1.35% with shared authors were sufficiently similar to be considered a duplicate. Extrapolating, this would correspond to 3500 and 117,500 duplicate citations in total, respectively. AVAILABILITY: eTBLAST, an automated citation matching tool, and Déjà vu, the duplicate citation database, are freely available at http://invention.swmed.edu/ and http://spore.swmed.edu/dejavu Mounir Errami, Justin M. Hicks, Wayne G. Fisher, David Trusty, Jonathan D. Wren, Tara C. Long, Harold R. Garner |
Bioinform. | 1 |
| 2008 | Exhaustive prediction of disease susceptibility to coding base changes in the human genomeabstractBACKGROUND: Single Nucleotide Polymorphisms (SNPs) are the most abundant form of genomic variation and can cause phenotypic differences between individuals, including diseases. Bases are subject to various levels of selection pressure, reflected in their inter-species conservation. RESULTS: We propose a method that is not dependant on transcription information to score each coding base in the human genome reflecting the disease probability associated with its mutation. Twelve factors likely to be associated with disease alleles were chosen as the input for a support vector machine prediction algorithm. The analysis yielded 83% sensitivity and 84% specificity in segregating disease like alleles as found in the Human Gene Mutation Database from non-disease like alleles as found in the Database of Single Nucleotide Polymorphisms. This algorithm was subsequently applied to each base within all known human genes, exhaustively confirming that interspecies conservation is the strongest factor for disease association. For each gene, the length normalized average disease potential score was calculated. Out of the 30 genes with the highest scores, 21 are directly associated with a disease. In contrast, out of the 30 genes with the lowest scores, only one is associated with a disease as found in published literature. The results strongly suggest that the highest scoring genes are enriched for those that might contribute to disease, if mutated. CONCLUSION: This method provides valuable information to researchers to identify sensitive positions in genes that have a high disease probability, enabling them to optimize experimental designs and interpret data emerging from genetic and epidemiological studies. Vinayak Kulkarni, Mounir Errami, Robert Barber, Harold R. Garner |
BMC Bioinform. | 2 |
| 2006 | Text similarity: an alternative way to search MEDLINEabstractMOTIVATION: The most widely used literature search techniques, such as those offered by NCBI's PubMed system, require significant effort on the part of the searcher, and inexperienced searchers do not use these systems as effectively as experienced users. Improved literature search engines can save researchers time and effort by making it easier to locate the most important and relevant literature. RESULTS: We have created and optimized a new, hybrid search system for Medline that takes natural text as input and then delivers results with high precision and recall. The combination of a fast, low-sensitivity weighted keyword-based first pass algorithm to cast a wide net to gather an initial set of literature, followed by a unique sentence-alignment based similarity algorithm to rank order those results was developed that is sensitive, fast and easy to use. Several text similarity search algorithms, both standard and novel, were implemented and tested in order to determine which obtained the best results in information retrieval exercises. AVAILABILITY: Literature searching algorithms are implemented in a system called eTBLAST, freely accessible over the web at http://invention.swmed.edu. A variety of other derivative systems and visualization tools provides the user with an enhanced experience and additional capabilities. CONTACT: [email protected]. Stephan Ossowski, Justin M. Hicks, Mounir Errami, Harold R. Garner |
Bioinform. | 4 |
| 2005 | Friend, an integrated analytical front-end application for bioinformaticsabstractUNLABELLED: Friend is a bioinformatics application designed for simultaneous analysis and visualization of multiple structures and sequences of proteins and/or DNA/RNA. The application provides basic functionalities, such as structure visualization, with different rendering and coloring, sequence alignment and simple phylogeny analysis, along with a number of extended features to perform more complex analyses of sequence structure relationships, including structural alignment of proteins, investigation of specific interaction motifs, studies of protein-protein and protein-DNA interactions and protein super-families. It is also useful for functional annotation of proteins, protein modeling and protein folding studies. Friend provides three levels of usage: (1) an extensive GUI for a scientist with no programming experience, (2) a command line interface for scripting for a scientist with some programming experience and (3) the ability to extend Friend with user written libraries for an experienced programmer. The application is linked and communicates with local and remote sequence and structure databases. AVAILABILITY: http://mozart.bio.neu.edu/friend. Alexej Abyzov, Mounir Errami, Chesley M. Leslin, Valentin A. Ilyin |
Bioinform. | 2 |
| 2003 | Detection of unrelated proteins in sequences multiple alignments by using predicted secondary structuresabstractMOTIVATION: Multiple sequence alignments are essential tools for establishing the homology relations between proteins. Essential amino acids for the function and/or the structure are generally conserved, thus providing key arguments to help in protein characterization. However for distant proteins, it is more difficult to establish, in a reliable way, the homology relations that may exist between them. In this article, we show that secondary structure prediction is a valuable way to validate protein families at low identity rate. RESULTS: We show that the analysis of the secondary structures compatibility is a reliable way to discard non-related proteins in low identity multiple alignment. AVAILABILITY: This validation is possible through our NPS@ server (http://npsa-pbil.ibcp.fr) Mounir Errami, Christophe Geourjon, Gilbert Deléage |
Bioinform. | 1 |