Остановите войну!
for scientists:
default search action
Pradipta Maji
- > Home > Persons > Pradipta Maji
Publications
- 2017
- [j48]Pradipta Maji, Ekta Shah, Sushmita Paul:
RelSim: An integrated method to identify disease genes using gene expression profiles and PPIN based similarity measure. Inf. Sci. 384: 110-125 (2017) - 2016
- [j40]Sushmita Paul, Pradipta Maji:
Gene expression and protein-protein interaction data for identification of colon cancer related genes using f-information measures. Nat. Comput. 15(3): 449-463 (2016) - 2015
- [c34]Pradipta Maji, Ekta Shah, Sushmita Paul:
A New Similarity Measure for Identification of Disease Genes. PReMI 2015: 451-461 - 2014
- [b1]Pradipta Maji, Sushmita Paul:
Scalable Pattern Recognition Algorithms - Applications in Computational Biology and Bioinformatics. Springer 2014, ISBN 978-3-319-05629-6, pp. 1-297 - [j33]Sushmita Paul, Pradipta Maji:
Gene ontology based quantitative index to select functionally diverse genes. Int. J. Mach. Learn. Cybern. 5(2): 245-262 (2014) - 2013
- [j30]Sushmita Paul, Pradipta Maji:
µHEM for identification of differentially expressed miRNAs using hypercuboid equivalence partition matrix. BMC Bioinform. 14: 266 (2013) - [j29]Pradipta Maji, Sushmita Paul:
Robust Rough-Fuzzy C-Means Algorithm: Design and Applications in Coding and Non-coding RNA Expression Data Clustering. Fundam. Informaticae 124(1-2): 153-174 (2013) - [j28]Pradipta Maji, Sushmita Paul:
Rough-Fuzzy Clustering for Grouping Functionally Similar Genes from Microarray Data. IEEE ACM Trans. Comput. Biol. Bioinform. 10(2): 286-299 (2013) - [c28]Sushmita Paul, Pradipta Maji:
City Block Distance for Identification of Co-expressed MicroRNAs. SEMCCO (2) 2013: 387-396 - [p2]Pradipta Maji, Sushmita Paul:
Rough Set-Based Feature Selection: Criteria of Max-Dependency, Max-Relevance, and Max-Significance. Rough Sets and Intelligent Systems (2) 2013: 393-418 - 2012
- [c26]Sushmita Paul, Pradipta Maji:
Robust RFCM algorithm for identification of co-expressed miRNAs. BIBM 2012: 1-4 - [c25]Sushmita Paul, Pradipta Maji:
Rough sets and support vector machine for selecting differentially expressed miRNAs. BIBM Workshops 2012: 864-871 - [c23]Pradipta Maji, Sushmita Paul:
Rough-Fuzzy C-Means for Clustering Microarray Gene Expression Data. PerMIn 2012: 203-210 - [c21]Sushmita Paul, Pradipta Maji:
A New Rough-Fuzzy Clustering Algorithm and its Applications. SocProS 2012: 1245-1251 - 2011
- [j24]Pradipta Maji, Sushmita Paul:
Rough set based maximum relevance-maximum significance criterion and Gene selection from microarray data. Int. J. Approx. Reason. 52(3): 408-426 (2011) - [c20]Pradipta Maji, Sushmita Paul:
Microarray Time-Series Data Clustering Using Rough-Fuzzy C-Means Algorithm. BIBM 2011: 269-272 - [c19]Sushmita Paul, Pradipta Maji:
Rough Sets for Selection of Functionally Diverse Genes from Microarray Data. SEMCCO (1) 2011: 477-484 - 2010
- [j19]Pradipta Maji, Sushmita Paul:
Rough Sets for Selection of Molecular Descriptors to Predict Biological Activity of Molecules. IEEE Trans. Syst. Man Cybern. Part C 40(6): 639-648 (2010)
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-05 02:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint