IEEE ... International Conference on Computational Advances in Bio and Medical Sciences : [proceedings]. IEEE International Conference on Computational Advances in Bio and Medical Sciences最新文献
{"title":"Pairing T Cell Receptor α and β sequences using pooling and min-cost flows","authors":"Tyler Daddio, I. Măndoiu","doi":"10.1109/ICCABS.2016.7802789","DOIUrl":"https://doi.org/10.1109/ICCABS.2016.7802789","url":null,"abstract":"this work we introduce a large-scale b-matching problem modeling reconstruction of the α-β T-cell receptor repertoire from independent sequencing of α and β genes for random pools of T-cells. A scalable solution based on heuristic sparsification of the underlying bipartite graph and minimum-cost network flows shows promising results in empirical experiments on simulated data.","PeriodicalId":89933,"journal":{"name":"IEEE ... International Conference on Computational Advances in Bio and Medical Sciences : [proceedings]. IEEE International Conference on Computational Advances in Bio and Medical Sciences","volume":"196 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77395691","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":"Phylogenetic uncertainty and transmission network inference: Lessons from phylogenetic reconciliation","authors":"Mukul S. Bansal","doi":"10.1109/ICCABS.2016.7802785","DOIUrl":"https://doi.org/10.1109/ICCABS.2016.7802785","url":null,"abstract":"The inference of transmission networks from genetic sequence data is an important problem in epidemiology. One approach for building transmission networks is to first reconstruct a phylogenetic tree on the sampled sequences and to then infer transmissions based on this tree. This approach depends crucially on the accuracy of the reconstructed phylogeny and of the transmission inference procedure. However, there is often considerable uncertainty and error in reconstructed phylogenies and significant ambiguity in transmission inference. In this talk, we will introduce a new phylogenetic approach to inferring transmission networks, discuss some of the challenges to the successful implementation of such an approach, and consider some ideas for overcoming these challenges inspired by the literature on phylogenetic reconciliation.","PeriodicalId":89933,"journal":{"name":"IEEE ... International Conference on Computational Advances in Bio and Medical Sciences : [proceedings]. IEEE International Conference on Computational Advances in Bio and Medical Sciences","volume":"1 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81914970","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":"Multicore and GPU Algorithms for Nussinov RNA Folding.","authors":"Junjie Li, Sanjay Ranka, Sartaj Sahni","doi":"10.1109/ICCABS.2013.6629204","DOIUrl":"https://doi.org/10.1109/ICCABS.2013.6629204","url":null,"abstract":"<p><p>We develop cache efficient, multicore, and GPU algorithms for RNA folding using Nussinov's equations. Our cache efficient algorithm provides a speedup between 1.6 and 3.0 relative to a naive straightforward single core code. The multicore version of the cache efficient single core algorithm provides a speedup, relative to the naive single core algorithm, between 7.5 and 14.0 on a 6 core hyperthreaded CPU. Our GPU algorithm for the NVIDIA C2050 is up to 1582 times as fast as the naive single core algorithm and between 5.1 and 11.2 times as fast as the fastest previously known GPU algorithm for Nussinov RNA folding.</p>","PeriodicalId":89933,"journal":{"name":"IEEE ... International Conference on Computational Advances in Bio and Medical Sciences : [proceedings]. IEEE International Conference on Computational Advances in Bio and Medical Sciences","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICCABS.2013.6629204","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"31996184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mai Hamdalla, David Grant, Ion Mandoiu, Dennis Hill, Sanguthevar Rajasekaran, Reda Ammar
{"title":"The use of graph matching algorithms to identify biochemical substructures in synthetic chemical compounds: Application to metabolomics.","authors":"Mai Hamdalla, David Grant, Ion Mandoiu, Dennis Hill, Sanguthevar Rajasekaran, Reda Ammar","doi":"10.1109/ICCABS.2012.6182637","DOIUrl":"https://doi.org/10.1109/ICCABS.2012.6182637","url":null,"abstract":"<p><p>Metabolomics is a rapidly growing field studying the small-molecule metabolite profile of a biological organism. Studying metabolism has a potential to contribute to biomedical research as well as drug discovery. One of the current challenges in metabolomics is the identification of unknown metabolites as existing chemical databases are incomplete. We present a novel way of utilizing known mammalian metabolites in an effort to identify unknown ones. The system relies on a mammalian scaffolds database to aid the classification process. The results show that 96% of the mammalian compounds were identified as truly mammalian in a leave-one-out experiment. The system was also tested with a random set of synthetic compounds, downloaded from ChemBridge and ChemSynthesis databases. The system was able to eliminate 54% of the set, leaving 46% of the compounds as potentially unknown mammalian metabolites.</p>","PeriodicalId":89933,"journal":{"name":"IEEE ... International Conference on Computational Advances in Bio and Medical Sciences : [proceedings]. IEEE International Conference on Computational Advances in Bio and Medical Sciences","volume":"2012 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICCABS.2012.6182637","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34138728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Pairwise Sequence Alignment for Very Long Sequences on GPUs.","authors":"Junjie Li, Sanjay Ranka, Sartaj Sahni","doi":"10.1109/ICCABS.2012.6182641","DOIUrl":"https://doi.org/10.1109/ICCABS.2012.6182641","url":null,"abstract":"<p><p>We develop novel single-GPU parallelizations of the Smith-Waterman algorithm for pairwise sequence alignment. Our algorithms, which are suitable for the alignment of a single pair of very long sequences, can be used to determine the alignment score as well as the actual alignment. Experimental results demonstrate an order of magnitude reduction in run time relative to competing GPU algorithms.</p>","PeriodicalId":89933,"journal":{"name":"IEEE ... International Conference on Computational Advances in Bio and Medical Sciences : [proceedings]. IEEE International Conference on Computational Advances in Bio and Medical Sciences","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICCABS.2012.6182641","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"31952478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"PMS6: A Fast Algorithm for Motif Discovery.","authors":"Shibdas Bandyopadhyay, Sartaj Sahni, Sanguthevar Rajasekaran","doi":"10.1109/ICCABS.2012.6182627","DOIUrl":"10.1109/ICCABS.2012.6182627","url":null,"abstract":"<p><p>We propose a new algorithm, PMS6, for the (<i>l</i>, <i>d</i>)-motif discovery problem in which we are to find all strings of length <i>l</i> that appear in every string of a given set of strings with at most <i>d</i> mismatches. The run time ratio PMS5/PMS6, where PMS5 is the fastest previously known algorithm for motif discovery in large instances, ranges from a high of 2.20 for the (21,8) challenge instances to a low of 1.69 for the (17,6) challenge instances. Both PMS5 and PMS6 require some amount of preprocessing. The preprocessing time for PMS6 is 34 times faster than that for PMS5 for (23,9) instances. When preprocessing time is factored in, the run time ratio PMS5/PMS6 is as high as 2.75 for (13,4) instances and as low as 1.95 for (17,6) instances.</p>","PeriodicalId":89933,"journal":{"name":"IEEE ... International Conference on Computational Advances in Bio and Medical Sciences : [proceedings]. IEEE International Conference on Computational Advances in Bio and Medical Sciences","volume":" ","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3744182/pdf/nihms499893.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"31668930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Vikram Appia, Balaji Ganapathy, Anthony Yezzi, Tracy Faber
{"title":"Localized Principal Component Analysis based Curve Evolution: A Divide and Conquer Approach.","authors":"Vikram Appia, Balaji Ganapathy, Anthony Yezzi, Tracy Faber","doi":"10.1109/ICCV.2011.6126469","DOIUrl":"https://doi.org/10.1109/ICCV.2011.6126469","url":null,"abstract":"<p><p>We propose a novel localized principal component analysis (PCA) based curve evolution approach which evolves the segmenting curve semi-locally within various target regions (divisions) in an image and then combines these locally accurate segmentation curves to obtain a global segmentation. The training data for our approach consists of training shapes and associated auxiliary (target) masks. The masks indicate the various regions of the shape exhibiting highly correlated variations locally which may be rather independent of the variations in the distant parts of the global shape. Thus, in a sense, we are clustering the variations exhibited in the training data set. We then use a parametric model to implicitly represent each localized segmentation curve as a combination of the local shape priors obtained by representing the training shapes and the masks as a collection of signed distance functions. We also propose a parametric model to combine the locally evolved segmentation curves into a single hybrid (global) segmentation. Finally, we combine the evolution of these semilocal and global parameters to minimize an objective energy function. The resulting algorithm thus provides a globally accurate solution, which retains the local variations in shape. We present some results to illustrate how our approach performs better than the traditional approach with fully global PCA.</p>","PeriodicalId":89933,"journal":{"name":"IEEE ... International Conference on Computational Advances in Bio and Medical Sciences : [proceedings]. IEEE International Conference on Computational Advances in Bio and Medical Sciences","volume":"2011 ","pages":"1981-1986"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICCV.2011.6126469","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32918577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}