| dc.contributor.author | Seo, San Ha | |
| dc.description.abstract | Large amount of gene expression data has been collected for various environmental and biological conditions. Extracting dense modules that are recurrent in multiple gene coexpression networks has been shown to be promising in functional gene annotation and biomarkers discovery. In this thesis, we propose a biclustering-based approach for mining approximate frequent dense modules. This approach reports a large number of modules with many duplicate modules. Thus, we build on this approach and propose two extended approaches for mining dense modules, which mine set of representative patterns using post-processing and on-line pattern summarization methods. The extended approaches report smaller number of modules and less duplicate modules. Experiments on real gene coexpression networks show that frequent dense modules are biologically interesting as evidenced by the large percentage of biologically enriched frequent dense modules. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU policy 190.6.2 | en_US |
| dc.title | Mining Approximate Frequent Dense Modules from Multiple Gene Expression Datasets | en_US |
| dc.type | Thesis | en_US |
| dc.date.accessioned | 2022-04-07T14:46:26Z | |
| dc.date.available | 2022-04-07T14:46:26Z | |
| dc.date.issued | 2021 | |
| dc.identifier.uri | https://hdl.handle.net/10365/32307 | |
| dc.subject | bioinformatics | en_US |
| dc.subject | gene coexpression network | en_US |
| dc.subject | graph mining | en_US |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | en_US |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Engineering | en_US |
| ndsu.department | Computer Science | en_US |
| ndsu.program | Computer Science | en_US |
| ndsu.advisor | Salem, Saeed | |
