M. Bhattacharya, K. Pal, G. Ghosh, Som Shuvra Mandal
{"title":"Generation of novel encrypted code using cryptography for multiple level data security for Electronic Patient Record","authors":"M. Bhattacharya, K. Pal, G. Ghosh, Som Shuvra Mandal","doi":"10.1109/BIBM.2015.7359806","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359806","url":null,"abstract":"Current paper represents a new type of encrypted Electronic Patient Record (EPR) code used for data encryption and content protection. EPR is a collection of several private information related to a patient which needs data authenticity, data security as well as safe and secured transmission. The proposed methodology used both cryptography and image processing techniques to build a new type of encrypted information code in image format which can be transmitted and used like bar code, QR code but even more secure. The success rate of recovery of data is 100% for both short and long messages. The information can also be retrieved at the receiver side exactly same without any loss of information. Use of RSA and DES algorithm consequently, with three keys and followed by some image processing techniques like complement, flip make the proposed algorithm more unbreakable. In this paper a complete Graphical User Interface (GUI) has been developed for both encoder-transmitter and decoder- receiver section.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Semantic rules for extracting proteins functions information from biomedical abstracts","authors":"K. Taha","doi":"10.1109/BIBM.2015.7359749","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359749","url":null,"abstract":"We present a classifier system called SRPFP that predicts the functions of un-annotated proteins. SRPFP aims at enhancing the state of the art of biological text mining. It analyzes biomedical texts in order to discover protein function information that is difficult to retrieve. It employs semantic rules for extracting proteins functions information from biomedical abstracts. It applies a novel model and linguistic computational techniques for extracting the functional relationship from different structural forms of terms in the sentences of biological abstracts. Specifically, SRPFP extracts phrases that represent functional relationships between proteins and molecules. These molecules usually bind to the proteins and are highly predictive of the functions of these proteins. The proposed semantic rules can identify the semantic relationship between each co-occurrence of a protein-molecule pair using the syntactic structures of sentences and linguistics theories. SRPFP represents each protein by the molecules that have high co-occurrences with the protein in biomedical abstracts. This is because such molecules are good characteristics and indicators of the functions of proteins. SRPFP measures the semantic similarity between the molecules representing an un-annotated protein p and the molecules representing annotated proteins and assigns p the functions of annotated proteins that are similar to p.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"438 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126130101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On frequency dependencies of sliding window correlation","authors":"S. Shakil, S. Keilholz, Chin-Hui Lee","doi":"10.1109/BIBM.2015.7359708","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359708","url":null,"abstract":"Sliding window correlation (SWC) is one of the most popular methods to study the dynamics of functional connectivity from resting-state functional MRI scans. These scanned signals are often non-stationary and normally bandpass filtered before the SWC analysis, so there are more than one frequency component present in the correlating signals. In this paper we study the effects of two frequencies in such signals by extending the findings of an earlier study that considered only a single frequency. Although the fluctuations in the SWC are reduced when the length of the window approaches the minimum window length, as reported in the earlier study, but the ability of the SWC to give the stationary correlation value dependents on the ratio of the two frequencies rather than the minimum frequency only. Furthermore, some undesirable components other than the modulating frequency would be extracted from non-stationary analysis under certain conditions.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128107496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Papadopoulou, K. Kotta, P. Moschonas, V. Douka, A. Anagnostopoulos, K. Stamatopoulos, D. Tzovaras
{"title":"Chronic lymphocytic leukemia patient classification methodology through flow cytometry analysis","authors":"E. Papadopoulou, K. Kotta, P. Moschonas, V. Douka, A. Anagnostopoulos, K. Stamatopoulos, D. Tzovaras","doi":"10.1109/BIBM.2015.7359778","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359778","url":null,"abstract":"Flow cytometry (FC) is widely used for diagnostic purposes in clinical practice. This analysis typically aims at clustering cellular events according to their biological characteristics, known as gating, and then use the selected clusters in order to conclude about clinical outcomes. As each step of this process is highly subjective, various proposed methods have attempted to automate each step of the procedure separately, but any method has been proposed in order to automate the whole diagnostic process. We constructed a tool that simulates the experts decisions during the whole process in order to conclude if a sample is pathologic or not (`healthy'). We used flow cytometric data from 10 individuals with a diagnosis of chronic lymphocytic leukemia (CLL) from a panel that produces 7 files for each sample. With the help of the present tool we were able to identify whether the analysis of the tested sample confirms the diagnosis of CLL, thus successfully reproducing the experts' decisions at each step of the diagnostic workflow. The validation was conducted by experts against the traditional manual procedure. The proposed methodology is the first attempt to automate the entire process, which is a prerequisite for a fully automated diagnostic system that would ensure objectivity to the clinical diagnostic procedure. The experimental results presented herein show that our proposed new technique has satisfying performance at each level of evaluation.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127482306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jeffrey D. McGovern, Alex Dekhtyar, C. Kitts, Michael Black, Jennifer Vanderkelen, Anya L. Goodman
{"title":"Leveraging the k-Nearest Neighbors classification algorithm for Microbial Source Tracking using a bacterial DNA fingerprint library","authors":"Jeffrey D. McGovern, Alex Dekhtyar, C. Kitts, Michael Black, Jennifer Vanderkelen, Anya L. Goodman","doi":"10.1109/BIBM.2015.7359930","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359930","url":null,"abstract":"Fecal contamination in bodies of water is an issue that cities must combat regularly. Often, city governments must restrict access to water sources until the contaminants dissipate. Sourcing the species of the fecal matter helps curb the issue in the future, giving city governments the ability to mitigate the effects before they occur again. Microbial Source Tracking (MST) aims to determine source host species of strains of microbiological lifeforms and library-based MST is one method that can assist in sourcing fecal matter. Recently, the Biology Department in conjunction with the Computer Science Department at California Polytechnic State University San Luis Obispo (Cal Poly) teamed up to build a database called the Cal Poly Library of Pyroprints (CPLOP). Students collect fecal samples, culture and pyrosequence the E. coli in the samples, and insert this data, called pyroprints, into CPLOP. Using two intergenic transcribed spacer regions of DNA, Cal Poly biologists perform studies on strain differentiation. We propose using k-Nearest Neighbors, a straightforward machine learning technique, to classify the host species of a given pyroprint, construct four algorithms to resolve the regions, and investigate classification accuracy.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124294363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integrating prior biological knowledge and graphical LASSO for network inference","authors":"Yiming Zuo, Guoqiang Yu, H. Ressom","doi":"10.1109/BIBM.2015.7359905","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359905","url":null,"abstract":"Systems biology aims at unravelling the mechanisms of complex diseases by investigating how individual elements of the cell (e.g., genes, proteins, metabolites, etc.) interact with each other. Network-based methods provide an intuitive framework to model, characterize, and understand these interactions. To reconstruct a biological network, one can either query public databases for known interactions (knowledge-driven approach) or build a mathematical model to measure the associations from data (data-driven approach). In this paper, we propose a new network inference method, integrating knowledge and data-driven approaches. The method integrates prior biological knowledge (i.e., protein-protein interactions from BioGRID database) and a Gaussian graphical model (i.e., graphical LASSO algorithm) to construct robust and biologically relevant network. The network is then utilized to extract differential sub-networks between case and control groups using the result from a statistical analysis (e.g., logistic regression). We applied the proposed method on a proteomic dataset acquired by analysis of sera from hepatocellular carcinoma (HCC) cases and patients with liver cirrhosis. The differential sub-networks led to the identification of hub proteins and key pathways, whose relevance to HCC study has been confirmed by literature survey.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121561238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ZSeq 2.0: A fully automatic preprocessing method for next generation sequencing data","authors":"A. Alkhateeb, Iman Rezaeian, L. Rueda","doi":"10.1109/BIBM.2015.7359954","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359954","url":null,"abstract":"Preprocessing is a critical step in next generation sequencing (NGS) data analysis, since any error or artifact in library preparation and the sequencing process can affect subsequent steps, leading to possibly erroneous biological conclusions. In this work, we propose ZSeq 2.0, a fully automatic NGS preprocessing method, which combines the strength of the original ZSeq method with a free of parameters scheme that automatically detects and filters out low complexity and highly biased regions, without any need for parameter adjustment. We estimate parameters by applying dynamic penalty rates to high and low GC-content sequences. We also use a labeling rule method to detect outlier sequences that have very low NUS. Some other preprocessing features have been added to ZSeq2.0, including adapter detection and low-quality nucleotides trimming at each side of the sequence. ZSeq2.0 is publicly available and can be downloaded from http://sourceforge.net/p/ZSeq/wiki/Home/.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130392588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"HapColor: A graph coloring framework for polyploidy phasing","authors":"Sepideh Mazrouee, Wei Wang","doi":"10.1109/BIBM.2015.7359663","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359663","url":null,"abstract":"Polyploidy, the presence of more than two copies of each chromosome in the cells of an organism, is common in plants and animals, and finds important applications in the field of genetics. To understand structure of each chromosome using Next Generation Sequencing (NGS), haplotype assembly is needed.We propose HapColor, a fragment partitioning approach, based on a new conflict graph model. We introduce a graph coloring algorithm followed by a color merging method to accurately group DNA short reads into any number of partitions depending on the ploidy level of the organism from which the sequencing data are derived. We compare HapColor with HapTree (a recently introduced polyploidy haplotyping), PGreedy (a polyploidy haplotyping that we develop based on Levy's well-known greedy algorithm) and RFP (a baseline random fragment partitioning method). Our analysis on Triploid, Tetraploid, Hexaploid, and Decaploid datasets demonstrate that HapColor substantially improves haplotype assembly accuracy of the other algorithms. The amount of improvement ranges from 25% to 90% depending on the ploidy level.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124658651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hong Zhou, Joseph Manthey, E. Lioutikova, Mary Yang, William Yang, K. Yoshigoe, Hong Wang
{"title":"The upregulation of Myb and Peg3 may mediate EGCG inhibition effect on mouse lung adenocarcinoma","authors":"Hong Zhou, Joseph Manthey, E. Lioutikova, Mary Yang, William Yang, K. Yoshigoe, Hong Wang","doi":"10.1109/BIBM.2015.7359903","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359903","url":null,"abstract":"The antioxidant activity of green tea polyphenol epigallocatechin-3-gallate (EGCG) has been found to be critical in inhibiting carcinogenesis. In our previous study, we identified a set of protein coding genes and microRNAs whose expressions were significantly modulated in response to the EGCG treatment in tobacco carcinogen-induced lung adenocarcinoma in A/J mice. In this study, we further conducted some statistical analysis on our microarray data and employed The Cancer Genome Atlas (TCGA) lung adenocarcinoma datasets as additional control. We postulated that if a gene mediates EGCG's cancer inhibition, its expression level change caused by EGCG should be opposite to what occurred in the carcinogenesis. With this assumption, we identified Myb and Peg3 as the primary genes involved in the cancer inhibitory activities of EGCG.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115052704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Novel Isoniazid- and Ethionamide-resistance loci in mycobacterium tuberculosis identified by phenome-wide association scans","authors":"Zhi-Hua Pei, Ting Xie, Qing-Yong Yang, Qing-Ye Zhang, Hong-yu Zhang","doi":"10.1109/BIBM.2015.7359840","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359840","url":null,"abstract":"Due to the wide spread of multidrug-resistant tuberculosis, Mycobacterium tuberculosis (MTB) has once again become a serious public health threat. However, drug resistance mechanisms and the many loci related to drug resistance in MTB currently remain unclear. Similar to genome-wide association studies (GWASs), phenome-wide association scans (PheWAS) is a method for evaluating the association between whole phenotypes and a significant SNP. In this study, we identified S315N, S315T and R463L SNP sites within the katG gene that are related to INH-resistance as well as W191R and G169S SNPs within the katG gene related to ETH-resistance in MTB using the PheWAS method with the available data of Zhang et al. Compared with the GWAS results reported by Zhang et al., R463L and S315N were new sites of the INH prodrug identified by the PheWAS method. Moreover, S266R on gene ethA and A187V variation on mshA are also new sites that were found to be significantly associated with the resistance of ETH by our approach. The loci found by the PheWAS analysis method in this study had been experimentally estimated to be associated with drug resistance in MTB. These findings lend further credence to our PheWAS analysis method in SNP analysis and demonstrate the power of PheWAS in genetic disease loci identification.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125761257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}