default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWassim Ayadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c10]Ons Maâtouk, Emna Ayari, Hend Bouziri, Wassim Ayadi
:
BOBEA: a bi-objective biclustering evolutionary algorithm for genome-wide association analysis. GECCO Companion 2022: 344-347- 2021
- [j8]Ons Maâtouk, Wassim Ayadi, Hend Bouziri, Béatrice Duval:
Evolutionary Local Search Algorithm for the biclustering of gene expression data based on biological knowledge. Appl. Soft Comput. 104: 107177 (2021)
2010 – 2019
- 2019
- [j7]Ons Maâtouk, Wassim Ayadi, Hend Bouziri, Béatrice Duval:
Evolutionary biclustering algorithms: an experimental study on microarray data. Soft Comput. 23(17): 7671-7697 (2019) - 2018
- [j6]Amina Houari, Wassim Ayadi, Sadok Ben Yahia:
A new FCA-based method for identifying biclusters in gene expression data. Int. J. Mach. Learn. Cybern. 9(11): 1879-1893 (2018) - [c9]Amina Houari, Wassim Ayadi, Sadok Ben Yahia:
NBF: An FCA-Based Algorithm to Identify Negative Correlation Biclusters of DNA Microarray Data. AINA 2018: 1003-1010 - [c8]Wassim Ayadi:
Local Multiple Sequence Alignment with Biclustering. HEALTHINF 2018: 231-238 - 2017
- [c7]Amina Houari, Wassim Ayadi, Sadok Ben Yahia:
Mining Negative Correlation Biclusters from Gene Expression Data using Generic Association Rules. KES 2017: 278-287 - 2015
- [c6]Amina Houari, Wassim Ayadi, Sadok Ben Yahia:
Discovering Low Overlapping Biclusters in Gene Expression Data Through Generic Association Rules. MEDI 2015: 139-153 - 2014
- [j5]Wassim Ayadi, Jin-Kao Hao:
A memetic algorithm for discovering negative correlation biclusters of DNA microarray data. Neurocomputing 145: 14-22 (2014) - [c5]Ons Maâtouk, Wassim Ayadi, Hend Bouziri, Béatrice Duval:
Evolutionary Algorithm Based on New Crossover for the Biclustering of Gene Expression Data. PRIB 2014: 48-59 - 2012
- [j4]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
Pattern-driven neighborhood search for biclustering of microarray data. BMC Bioinform. 13(S-7): S11 (2012) - [j3]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
BicFinder: a biclustering algorithm for microarray data analysis. Knowl. Inf. Syst. 30(2): 341-358 (2012) - [j2]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
BiMine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data. Knowl. Based Syst. 35: 224-234 (2012) - [c4]Wassim Ayadi, Ons Maâtouk, Hend Bouziri:
Evolutionary Biclustering Algorithm of Gene Expression Data. DEXA Workshops 2012: 206-210 - 2010
- [c3]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
Iterated Local Search for Biclustering of Microarray Data. PRIB 2010: 219-229
2000 – 2009
- 2009
- [j1]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
A biclustering algorithm based on a Bicluster Enumeration Tree: application to DNA microarray data. BioData Min. 2: 9 (2009) - 2007
- [c2]Wassim Ayadi, Khedija Arour:
A Binary Decision Diagram to discover low threshold support frequent itemsets. DEXA Workshops 2007: 509-513 - [c1]Wassim Ayadi, Khedija Arour:
A Novel Parallel Boolean Approach for Discovering Frequent Itemsets. ICDM Workshops 2007: 297-302
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-04-24 22:48 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:
