Fabian Tobar-Tosse, Eliana Ocampo-Toro, Pedro M. Hernandez, A. Zuniga, Sebastian Florido-Sarria, Paula M. Hurtado
{"title":"Rare Diseases clustering based on structural regularities at the gene structure","authors":"Fabian Tobar-Tosse, Eliana Ocampo-Toro, Pedro M. Hernandez, A. Zuniga, Sebastian Florido-Sarria, Paula M. Hurtado","doi":"10.1109/BIBM.2015.7359961","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359961","url":null,"abstract":"Rare Diseases (RDs) are conditions with a high spectrum of genetic origins, whose phenotypic impact could define specific metabolic disorders or complex congenital anomalies. Accordingly, It is possible to propose at the point of view of the structural-genomics, that RDs define critical changes at the genome structure, which affect the cells functionality but not its viability. Herein, we present a bioinformatics approach for the identification of regularities among RDs related genes, which include the exploration of these genes at the map of the human genome reference, and its structural description considering the promoter regions. This approach allows us to identify structural regularities among RD genes, mainly related with the promoter regions, where the organization of genomic elements like CpG islands, and short repeats, allows an informative RDs clustering; that's mean nodes with functional and phenotypic meaning. For example, we present common regularities among RDs genes, which functionally are related to an immunological impact, and phenotypically with related syndromes: hyperimmunoglobulin E syndrome, Hyperimmunoglobulin E-recurrent infection syndrome, Job syndrome, and others. Based on our findings, we present an approximation for an integrative description of RDs, based on a basic structural-genomic overview.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133648486","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":"Cross-validation of data in SAXS and cryo-EM","authors":"B. Afsari, J. S. Kim, G. Chirikjian","doi":"10.1109/BIBM.2015.7359856","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359856","url":null,"abstract":"Cryo-Electron Microscopy (EM) and Small Angle X-ray Scattering (SAXS) are two different data acquisition modalities often used to glean information about the structure of large biomolecular complexes in their native states. A SAXS experiment is generally considered fast and easy but unveiling the structure at very low resolution, whereas a cryo-EM experiment needs more extensive preparation and post-acquisition computation to yield a 3D density map at higher resolution. In certain applications, one may need to verify if the data acquired in the SAXS and cryo-EM experiments correspond to the same structure (e.g., prior to reconstructing the 3D density map in EM). In this paper, a simple and fast method is proposed to verify the compatibility of the SAXS and EM experiments. The method is based on averaging the 2D correlation of EM images and the Abel transform of the SAXS data. The results are verified on simulations of conformational states of large biomolecular complexes.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"86 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":"123083258","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":"Computing transition paths in multiple-basin proteins with a probabilistic roadmap algorithm guided by structure data","authors":"T. Maximova, E. Plaku, Amarda Shehu","doi":"10.1109/BIBM.2015.7359652","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359652","url":null,"abstract":"Proteins are macromolecules in perpetual motion, switching between structural states to modulate their function. A detailed characterization of the precise yet complex relationship between protein structure, dynamics, and function requires elucidating transitions between functionally-relevant states. Doing so challenges both wet and dry laboratories, as protein dynamics involves disparate temporal scales. In this paper we present a novel, sampling-based algorithm to compute transition paths. The algorithm exploits two main ideas. First, it leverages known structures to initialize its search and define a reduced conformation space for rapid sampling. This is key to address the insufficient sampling issue suffered by sampling-based algorithms. Second, the algorithm embeds samples in a nearest-neighbor graph where transition paths can be efficiently computed via queries. The algorithm adapts the probabilistic roadmap framework that is popular in robot motion planning. In addition to efficiently computing lowest-cost paths between any given structures, the algorithm allows investigating hypotheses regarding the order of experimentally-known structures in a transition event. This novel contribution is likely to open up new venues of research. Detailed analysis is presented on multiple-basin proteins of relevance to human disease. Multiscaling and the AMBER ff12SB force field are used to obtain energetically-credible paths at atomistic detail.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"8 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":"121377684","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":"Implicit knowledge discovery in biomedical ontologies: Computing interesting relatednesses","authors":"Tian Bai, L. Gong, C. Kulikowski, Lan Huang","doi":"10.1109/BIBM.2015.7359734","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359734","url":null,"abstract":"Ontologies, seen as effective representations for sharing and reusing knowledge, have become increasingly important in biomedicine, usually focusing on taxonomic knowledge specific to a subject. Efforts have been made to uncover implicit knowledge within large biomedical ontologies by exploring semantic similarity and relatedness between concepts. However, much less attention has been paid to another potentially helpful approach: discovering implicit knowledge across multiple ontologies of different types, such as disease ontologies, symptom ontologies, and gene ontologies. In this paper, we propose a unified approach to the problem of ontology based implicit knowledge discovery - a Multi-Ontology Relatedness Model (MORM), which includes the formation of multiple related ontologies, a relatedness network and a formal inference mechanism based on set-theoretic operations. Experiments for biomedical applications have been carried out, and preliminary results show the potential value of the proposed approach for biomedical knowledge discovery.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"36 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":"125801414","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":"Bo's abdominal acupuncture mitigate post-stroke fatigue: A clinical center retrospective analysis","authors":"Ruihuan Pan, Mingfeng He, Lechang Zhan, Zhen Huang, Jie Zhan, Hongxia Chen","doi":"10.1109/BIBM.2015.7359931","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359931","url":null,"abstract":"Backgrounds: Post-stroke fatigue is a common and devastating malady of post-stroke patients. Bo's abdominal acupuncture is an effective therapeutic tool of Chinese medicine and widely used in practice in China. In this clinical study, we evaluated the therapeutic efficacy and safety of Bo's abdominal acupuncture for post-stroke fatigue. Methods: sixty participants with post-stroke fatigue were recruited and randomized to observational and acupuncture groups. The patients of acupuncture group were treated with Bo's abdominal acupuncture and rehabilitation exercise. The patients of observational group were treated with rehabilitation exercise. Two scoring systems, such as fatigue severity scale and stroke-specific quality of life scale, were used to analyze the therapeutic efficacy and safety of Bo's abdominal acupuncture, administered before and after treatment. Results: After four weeks, the patients with acupuncture displayed milder post-stroke fatigue in comparison with patients without acupuncture. Conclusion: Bo's abdominal acupuncture and rehabilitation exercise markedly mitigate post-stroke fatigue.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"54 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":"122399570","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":"Protein-protein interaction extraction based on actively transfer learning","authors":"Lishuang Li, Jieqiong Zheng, Dingxin Song, Rui Guo, Degen Huang","doi":"10.1109/BIBM.2015.7359936","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359936","url":null,"abstract":"In this paper, we present an actively transfer learning framework to extract PPI. Experimental results show that the proposed ActTrAdaBoost method performs much better than the baseline SVM and the original transfer learning method. In PPIE transfer learning task, our ActTrAdaBoost method presents better performance.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"30 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":"114416433","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}
V. B. Surya Prasath, Kiichi Fukuma, B. Aronow, H. Kawanaka
{"title":"Cell nuclei segmentation in glioma histopathology images with color decomposition based active contours","authors":"V. B. Surya Prasath, Kiichi Fukuma, B. Aronow, H. Kawanaka","doi":"10.1109/BIBM.2015.7359944","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359944","url":null,"abstract":"This work discusses the performance of a color decomposition based active contours for segmenting cell nuclei from glioma histopathology. By combining a nuclear staining information obtained from color decomposition with fast variational active contours we obtain unsupervised segmentation of nuclei in histopathological images. Experimental results show promise when compared with different state of the art techniques.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"32 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":"114501231","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":"Understanding heterogeneity in pregnancy-associated breast cancer","authors":"T. Nair","doi":"10.1109/BIBM.2015.7359851","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359851","url":null,"abstract":"Breast cancers diagnosed during pregnancy are generally in their advanced stages. These cancers occurring during pregnancy and up to one year postpartum are termed as pregnancy associated breast cancer. Recent genomic studies by Harvell et. al. was the first large scale study that attempted to identify molecular signatures associated with pregnancy associated breast cancer. In this study, we have rigorously analyzed the data with a view to identify features involved in within-class and between-class separation. The results reveal features that are unique between classes, as well as point to the importance of understanding heterogeneity within the same class.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"27 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":"116593751","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":"Design of a real-time morphology-based anomaly detection method from ECG streams","authors":"D. Ngo, B. Veeravalli","doi":"10.1109/BIBM.2015.7359793","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359793","url":null,"abstract":"Anomaly detection from ECG stream is a key step leading to a significant success of the remote and auto-triggered cardiac event monitoring system. This effort requires an online processing and efficient analysis on the real-time data. Moreover, its computational complexity should be kept low so that the detection algorithm can be implemented even on a small computing device used in sensor network. In this paper, we present a novel fast and effective approach to identify abnormalities based on differences of heart beat morphologies. Our approach is inspired from time-series data mining techniques and statistical outlier detection methods. The experimental results overall (open public QT database) demonstrate high quality performance. In particular, it obtains 0.971, 0.995 and 0.994, on an average, for of sensitivity, specificity and accuracy for the respective performance metrics.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"17 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":"116723227","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":"HPMA: High-performance metagenomic alignment tool, on a large-scale GPU cluster","authors":"I. Savran, J. Rose","doi":"10.1109/BIBM.2015.7359757","DOIUrl":"https://doi.org/10.1109/BIBM.2015.7359757","url":null,"abstract":"In this paper, we present HPMA, a graphics processing unit (GPU) accelerated meta-genome sequence alignment algorithm for a collection of DNA sequences. This algorithm supports all-to-all pairwise local alignment on NVIDIA GPUs. HPMA builds on an GPU alignment algorithm that we developed earlier with the addition of a filter module. We designed and developed this new kernel function based on the suffix array data structure. The filter module improves performance by identifying a subset of sequences which meet a user-defined similarity threshold and should be considered for alignment. HPMA has the ability to balance the workload between CPU and GPU. HPMA allows us to preprocess massively large metagenomes in a reasonable amount of time in response to increasing speed of NGS sequencers. The performance of HPMA has been evaluated on a cluster of Kepler-based Tesla K20 GPUs using a variety of short DNA sequence datasets. We evaluate HPMA thoroughly with four test datasets. The first two test sets are comprised of 10 simulated datasets where read length varies from 72 to 750 base-pairs. The third test set is designed to allow a comparison with published results for GSWABE, a competing GPU alignment tool. The fourth test set is an actual metagenome of over 2 million sequences with an average length of 270 bp. We utilized a cluster of NVIDIA-K20 GPUs in the Stampede supercomputer at the Texas Advanced Computing Center (Austin, TX, USA). When running on a cluster of 10 NVIDIA K20 GPUs, HPMA is able to align 2 million simulated metagenome sequences of length 300 bp in 160 seconds. In the case of real metagenomic data, HPMA is able to align 2,038,516 sequences with an average length of 270 bp in 60 seconds.","PeriodicalId":186217,"journal":{"name":"2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"27 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":"128475982","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}