default search action
Mourad Elloumi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j26]Hamdi Gassara, Mourad Elloumi, Omar Naifar
, Abdellatif Ben Makhlouf
Robust fault estimation for polynomial systems with time delay via a polynomial adaptive observer. Trans. Inst. Meas. Control 45(5): 955-962 (2023) - 2021
- [j25]Jens Allmer
Special Issue of the 1st International Applied Bioinformatics Conference (iABC'21). J. Integr. Bioinform. 18(4) (2021) - [j24]Haithem Aouabed, Mourad Elloumi, Rodrigo Santamaría:
An evaluation study of biclusters visualization techniques of gene expression data. J. Integr. Bioinform. 18(4) (2021) - [c42]Haithem Aouabed, Rodrigo Santamaría, Mourad Elloumi:
Visualizing Biclustering Results on Gene Expression Data: A Survey. ICBBT 2021: 170-179 - [c41]Naoual Guannoni, Faouzi Mhamdi, Mourad Elloumi:
Improved Multiple Part Algorithm (IMPA) to extract multiple solutions for RNA sequence classification problem. SEKE 2021: 346-351 - 2020
- [j23]Saif Eddine Abouda, Donia Ben Halima Abid, Mourad Elloumi, Yassine Koubaa, Abdessattar Chaari:
Identification of non-linear stochastic systems using a new Hammerstein-Wiener neural network: a simulation study through a non-linear hydraulic process. Int. J. Comput. Appl. Technol. 63(3): 241-256 (2020) - [j22]Hanen Mhamdi
Bayesian Integrative Modeling of Genome-Scale Metabolic and Regulatory Networks. Informatics 7(1): 1 (2020) - [j21]Haithem Aouabed, Rodrigo Santamaría, Mourad Elloumi:
VisBicluster: A Matrix-Based Bicluster Visualization of Expression Data. J. Comput. Biol. 27(9): 1384-1396 (2020) - [c40]Afef Ghanmi, Houda Salhi, Mourad Elloumi, Samira Kamoun:
Hierarchical Parameter Estimation for Wiener-Hammerstein Systems. SSD 2020: 115-121
2010 – 2019
- 2019
- [j20]Saif Eddine Abouda, Mourad Elloumi, Yassine Koubaa, Abdessattar Chaari:
Over parameterisation and optimisation approaches for identification of nonlinear stochastic systems described by Hammerstein-Wiener models. Int. J. Model. Identif. Control. 33(1): 61-75 (2019) - [j19]Ahmed Mokaddem, Amine Belhadi, Mourad Elloumi:
Refin-Align: New Refinement Algorithm For Multiple Sequence Alignment. Informatica (Slovenia) 43(4) (2019) - [c39]Hend Amraoui, Faouzi Mhamdi, Mourad Elloumi:
Fast Bat Algorithm for Predicting Diabetes Mellitus Using Association Rule Mining. ADMA 2019: 591-604 - [c38]Hend Amraoui, Mourad Elloumi, Francesco Marcelloni, Faouzi Mhamdi, Davide Verzotto
Theoretical and Practical Analyses in Metagenomic Sequence Classification. DEXA Workshops 2019: 27-37 - [c37]Naoual Guannoni, Faouzi Mhamdi, Emanuel Weitschek, Mourad Elloumi:
Novel algorithm to extract multiple solutions for RNA sequence classification problem. HPCS 2019: 856-863 - [c36]Hend Amraoui, Faouzi Mhamdi, Mourad Elloumi:
Association Rule Mining Using Discrete Jaya Algorithm. HPCS 2019: 872-879 - [c35]Naoual Guannoni
Improved Feature Selection Algorithm for Biological Sequences Classification. KSEM (1) 2019: 689-700 - [c34]Hend Amraoui, Faouzi Mhamdi, Mourad Elloumi:
Fast Exhaustive Search Algorithm for Discovering Relevant Association Rules. SEKE 2019: 681-777 - [e4]Gabriele Anderst-Kotsis, A Min Tjoa
Database and Expert Systems Applications - DEXA 2019 International Workshops BIOKDD, IWCFS, MLKgraphs and TIR, Linz, Austria, August 26-29, 2019, Proceedings. Communications in Computer and Information Science 1062, Springer 2019, ISBN 978-3-030-27683-6 [contents] - 2018
- [j18]Ahmed Mokaddem, Amine Bel Haj, Mourad Elloumi:
Pro-malign: Multiple Sequence Alignment Algorithm using Approached Profile. J. Softw. 13(1): 57-65 (2018) - [c33]Mourad Elloumi, Afef Ghanmi, Samira Kamoun:
Structural Parameter Identification Approaches for Interconnected Nonlinear Systems. SSD 2018: 1-6 - [c32]Haithem Aouabed, Rodrigo Santamaría, Mourad Elloumi:
Suitable Overlapping Set Visualization Techniques and Their Application to Visualize Biclustering Results on Gene Expression Data. DEXA Workshops 2018: 191-201 - [e3]Mourad Elloumi, Michael Granitzer, Abdelkader Hameurlain, Christin Seifert, Benno Stein, A Min Tjoa
Database and Expert Systems Applications - DEXA 2018 International Workshops, BDMICS, BIOKDD, and TIR, Regensburg, Germany, September 3-6, 2018, Proceedings. Communications in Computer and Information Science 903, Springer 2018, ISBN 978-3-319-99132-0 [contents] - 2017
- [j17]Haifa Ben Saber, Mourad Elloumi:
An enumerative biclustering algorithm based on greatest common divisor: application to DNA microarray data. Int. J. Comput. Appl. Technol. 55(1): 55-60 (2017) - [j16]Nadia Ben Nsira, Mourad Elloumi, Thierry Lecroq
On-line String Matching in Highly Similar DNA Sequences. Math. Comput. Sci. 11(2): 113-126 (2017) - [c31]Mehdi Kchouk, Jean-François Gibrat, Mourad Elloumi:
An Error Correction Algorithm for NGS Data. DEXA Workshops 2017: 84-87 - [p1]Nadia Ben Nsira, Thierry Lecroq
Algorithms for Indexing Highly Similar DNA Sequences. Algorithms for Next-Generation Sequencing Data 2017: 3-39 - [e2]Mourad Elloumi:
Algorithms for Next-Generation Sequencing Data, Techniques, Approaches, and Applications. Springer 2017, ISBN 978-3-319-59824-6 [contents] - 2016
- [j15]Mourad Elloumi, Samira Kamoun:
Parametric estimation of interconnected nonlinear systems described by input-output mathematical models. Int. J. Autom. Comput. 13(4): 364-381 (2016) - [j14]Mourad Elloumi, Samira Kamoun:
An iterative parametric estimation method for Hammerstein large-scale systems: a simulation study of hydraulic process. Int. J. Simul. Process. Model. 11(3/4): 207-219 (2016) - [c30]Mehdi Kchouk, Mourad Elloumi:
Hybrid error correction approach and de novo assembly for minion sequencing long reads. BIBM 2016: 122-125 - [c29]Mehdi Kchouk, Mourad Elloumi:
A clustering approach for denovo assembly using Next Generation Sequencing data. BIBM 2016: 1909-1911 - [c28]Mehdi Kchouk, Mourad Elloumi:
Efficient Hybrid De Novo Error Correction and Assembly for Long Reads. DEXA Workshops 2016: 88-92 - [c27]Akram Khemiri, Afef Kacem Echi
A System for Off-Line Arabic Handwritten Word Recognition Based on Bayesian Approach. ICFHR 2016: 560-565 - [c26]Naoual Guannoni, Rim Sassi, Walid Bedhiafi, Mourad Elloumi:
A Comparison Between Classification Algorithms for Postmenopausal Osteoporosis Prediction in Tunisian Population. ITBAM 2016: 234-248 - 2015
- [j13]Haifa Ben Saber, Mourad Elloumi:
A novel biclustering algorithm of binary microarray data: BiBinCons and BiBinAlter. BioData Min. 8: 38 (2015) - [j12]Nadia Ben Nsira, Thierry Lecroq
A fast Boyer-Moore type pattern matching algorithm for highly similar sequences. Int. J. Data Min. Bioinform. 13(3): 266-288 (2015) - [c25]Mehdi Kchouk, Mourad Elloumi:
Error correction and DeNovo genome Assembly for the MinIon sequencing reads mixing Illumina short reads. BIBM 2015: 1785 - [c24]Haifa Ben Saber, Mourad Elloumi:
A Hybrid Possibilistic Algorithm for Biclustering: Application to Microarray Data Analysis. DEXA Workshops 2015: 48-52 - [c23]Akram Khemiri, Afef Kacem Echi
Arabic handwritten words off-line recognition based on HMMs and DBNs. ICDAR 2015: 51-55 - [c22]Haifa Ben Saber, Mourad Elloumi:
An Enumerative Biclustering Algorithm for DNA Microarray Data. ICDM Workshops 2015: 132-138 - [c21]Mourad Elloumi, Samira Kamoun:
Optimal predictor and implicit self-tuning regulator for a class of Hammerstein large-scale systems. ICSC 2015: 417-423 - [c20]Haifa Ben Saber, Mourad Elloumi:
BiBinConvmean : A Novel Biclustering Algorithm for Binary Microarray Data. SEKE 2015: 178-181 - 2014
- [c19]Nadia Ben Nsira, Thierry Lecroq
A fast pattern matching algorithm for highly similar sequences. BIBM 2014: 32-38 - [c18]Tarek El Falah, Maroua Ghnimi, Mourad Elloumi:
A Consensus Algorithm for Simple Motifs Finding. DEXA Workshops 2014: 33-37 - [c17]Nadia Ben Nsira, Thierry Lecroq, Mourad Elloumi:
On-line String Matching in Highly Similar DNA Sequences. ICABD 2014: 16-22 - 2013
- [c16]Ahmed Mokaddem, Mourad Elloumi:
Motalign: A Multiple Sequence Alignment Algorithm Based on a New Distance and a New Score Function. DEXA Workshops 2013: 81-84 - 2012
- [j11]Wassim Ayadi
Pattern-driven neighborhood search for biclustering of microarray data. BMC Bioinform. 13(S-7): S11 (2012) - [j10]Wassim Ayadi
BicFinder: a biclustering algorithm for microarray data analysis. Knowl. Inf. Syst. 30(2): 341-358 (2012) - [j9]Wassim Ayadi
BiMine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data. Knowl. Based Syst. 35: 224-234 (2012) - [c15]Ahmed Mokaddem, Mourad Elloumi:
New Distances for Improving Progressive Alignment Algorithm. ACITY (2) 2012: 243-251 - [c14]Mourad Elloumi, Pedram Hayati, Costas S. Iliopoulos, Solon P. Pissis
Detection of fixed length web spambot using REAL (read aligner). CUBE 2012: 820-825 - [c13]Soumaya Hosni, Ahmed Mokaddem, Mourad Elloumi:
A New Progressive Multiple Sequence Alignment Algorithm. DEXA Workshops 2012: 195-198 - 2011
- [c12]Haifa Ben Saber, Mourad Elloumi, Mohamed Nadif
Block Mixture Model for the Biclustering of Microarray Data. DEXA Workshops 2011: 423-427 - [c11]Tarek El Falah, Thierry Lecroq
An Efficient Motif Search Algorithm Based on a Minimal Forbidden Patterns Approach. PACBB 2011: 175-182 - [c10]Ahmed Mokaddem, Mourad Elloumi:
PAAA: A Progressive Iterative Alignment Algorithm Based on Anchors. PRIB 2011: 296-305 - 2010
- [c9]Tarek El Falah, Thierry Lecroq, Mourad Elloumi:
SMS-Forbid: An Efficient Agorithm for Simple Motif Problem. BICoB 2010: 121-126 - [c8]Wassim Ayadi
Iterated Local Search for Biclustering of Microarray Data. PRIB 2010: 219-229
2000 – 2009
- 2009
- [j8]Wassim Ayadi
A biclustering algorithm based on a Bicluster Enumeration Tree: application to DNA microarray data. BioData Min. 2: 9 (2009) - 2008
- [c7]Hatem Tahri, Mourad Elloumi:
A New Approximation Algorithm for the Minimum Fragment Removal Problem. BIRD 2008: 427-435 - [c6]Mourad Elloumi, Ahmed Mokaddem:
An Algorithm for Multiple and Global Alignments. BIRD 2008: 479-488 - [c5]Faouzi Mhamdi, Mourad Elloumi:
A new survey on knowledge discovery and data mining. RCIS 2008: 427-432 - [e1]Mourad Elloumi, Josef Küng, Michal Linial, Robert F. Murphy, Kristan Schneider, Cristian Toma:
Bioinformatics Research and Development, Second International Conference, BIRD 2008, Vienna, Austria, July 7-9, 2008, Proceedings. Communications in Computer and Information Science 13, Springer 2008, ISBN 978-3-540-70598-7 [contents] - 2006
- [c4]Faouzi Mhamdi, Ricco Rakotomalala, Mourad Elloumi:
A Hierarchical n-Grams Extraction Approach for Classification Problem. SITIS 2006: 211-222 - 2005
- [j7]Mourad Elloumi, Mondher Maddouri:
New voting strategies designed for the classification of nucleic sequences. Knowl. Inf. Syst. 8(1): 1-15 (2005) - [c3]Ricco Rakotomalala, Faouzi Mhamdi, Mourad Elloumi:
Hybrid Feature Ranking for Proteins Classification. ADMA 2005: 610-617 - [c2]Faouzi Mhamdi, Ricco Rakotomalala, Mourad Elloumi:
Feature Ranking for Protein Classification. CORES 2005: 611-617 - 2004
- [j6]Mondher Maddouri, Mourad Elloumi:
Encoding of Primary Structures of Biological Macromolecules Within a Data Mining Perspective. J. Comput. Sci. Technol. 19(1): 78-88 (2004) - 2002
- [j5]Mourad Elloumi:
Algorithms for the Prediction of Secondary Structures of RNA Macromolecules. Int. J. Comput. Their Appl. 9(1) (2002) - [j4]Mourad Elloumi:
Foreword. Knowl. Based Syst. 15(4): 215 (2002) - [j3]Mondher Maddouri, Mourad Elloumi:
A data mining approach based on machine learning techniques to classify biological sequences. Knowl. Based Syst. 15(4): 217-223 (2002) - 2000
- [j2]Mourad Elloumi:
Algorithms for the shortest exact common superstring problem. South Afr. Comput. J. 26: 22-26 (2000)
1990 – 1999
- 1998
- [j1]Mourad Elloumi:
Comparison of Strings Belonging to the Same Family. Inf. Sci. 111(1-4): 49-63 (1998) - [c1]Mourad Elloumi:
New Algorithms to Predict Secondary Structures of RNA Macromolecules. IEA/AIE (Vol. 1) 1998: 864-875
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:00 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: