163 research outputs found

    Deep Learning using Convolutional LSTM estimates Biological Age from Physical Activity

    Get PDF
    Human age estimation is an important and difcult challenge. Diferent biomarkers and numerous approaches have been studied for biological age estimation, each with its advantages and limitations. In this work, we investigate whether physical activity can be exploited for biological age estimation for adult humans. We introduce an approach based on deep convolutional long short term memory (ConvLSTM) to predict biological age, using human physical activity as recorded by a wearable device. We also demonstrate fve deep biological age estimation models including the proposed approach and compare their performance on the NHANES physical activity dataset. Results on mortality hazard analysis using both the Cox proportional hazard model and Kaplan-Meier curves each show that the proposed method for estimating biological age outperforms other state-of-the-art approaches. This work has signifcant implications in combining wearable sensors and deep learning techniques for improved health monitoring, for instance, in a mobile health environment. Mobile health (mHealth) applications provide patients, caregivers, and administrators continuous information about a patient, even outside the hospital

    Preface

    Full text link
    Preface by Johnson Agbinya, H Anthony Chan and Donald Adjeroh

    Preface

    Full text link
    Information and communication technology (ICT) has taken a centre stage in the day to day activities of people in every country today, from social interactions to business and pleasure. The technologically advanced countries have been experiencing rapid changes in their way of life, through the fruits of research and developments in ICT. Many developing countries have also joined to contribute to global advancement in ICT and have indeed made fundamental changes to the lifestyle and working habit of their people

    A New Algorithm for “the LCS problem” with Application in Compressing Genome Resequencing Data

    Get PDF
    Background: The longest common subsequence (LCS) problem is a classical problem in computer science, and forms the basis of the current best-performing reference-based compression schemes for genome resequencing data. Methods: First, we present a new algorithm for the LCS problem. Using the generalized suffix tree, we identify the common substrings shared between the two input sequences. Using the maximal common substrings, we construct a directed acyclic graph (DAG), based on which we determine the LCS as the longest path in the DAG. Then, we introduce an LCS-motivated reference-based compression scheme using the components of the LCS, rather than the LCS itself. Results: Our basic scheme compressed the Homo sapiens genome (with an original size of 3,080,436,051 bytes) to 15,460,478 bytes. An improvement on the basic method further reduced this to 8,556,708 bytes, or an overall compression ratio of 360. This can be compared to the previous state-of-the-art compression ratios of 157 (Wang and Zhang, 2011) and 171 (Pinho, Pratas, and Garcia, 2011). Conclusion: We propose a new algorithm to address the longest common subsequence problem. Motivated by our LCS algorithm, we introduce a new reference-based compression scheme for genome resequencing data. Comparative results against state-of-the-art reference-based compression algorithms demonstrate the performance of the proposed method

    Network analysis of circular permutations in multidomain proteins reveals functional linkages for uncharacterized proteins.

    Get PDF
    Various studies have implicated different multidomain proteins in cancer. However, there has been little or no detailed study on the role of circular multidomain proteins in the general problem of cancer or on specific cancer types. This work represents an initial attempt at investigating the potential for predicting linkages between known cancer-associated proteins with uncharacterized or hypothetical multidomain proteins, based primarily on circular permutation (CP) relationships. First, we propose an efficient algorithm for rapid identification of both exact and approximate CPs in multidomain proteins. Using the circular relations identified, we construct networks between multidomain proteins, based on which we perform functional annotation of multidomain proteins. We then extend the method to construct subnetworks for selected cancer subtypes, and performed prediction of potential link-ages between uncharacterized multidomain proteins and the selected cancer types. We include practical results showing the performance of the proposed methods

    Adaptive Edge-Oriented Shot Boundary Detection

    Get PDF
    We study the problem of video shot boundary detection using an adaptive edge-oriented framework. Our approach is distinct in its use of multiple multilevel features in the required processing. Adaptation is provided by a careful analysis of these multilevel features, based on shot variability. We consider three levels of adaptation: at the feature extraction stage using locally-adaptive edge maps, at the video sequence level, and at the individual shot level. We show how to provide adaptive parameters for the multilevel edge-based approach, and how to determine adaptive thresholds for the shot boundaries based on the characteristics of the particular shot being indexed. The result is a fast adaptive scheme that provides a slightly better performance in terms of robustness, and a five fold efficiency improvement in shot characterization and classification. The reported work has applications beyond direct video indexing, and could be used in real-time applications, such as in dynamic monitoring and modeling of video data traffic in multimedia communications, and in real-time video surveillance. Experimental results are included

    Protein Surface Characterization Using an Invariant Descriptor

    Get PDF
    Aim. To develop a new invariant descriptor for the characterization of protein surfaces, suitable for various analysis tasks, such as protein functional classification, and search and retrieval of protein surfaces over a large database. Methods. We start with a local descriptor of selected circular patches on the protein surface. The descriptor records the distance distribution between the central residue and the residues within the patch, keeping track of the number of particular pairwise residue cooccurrences in the patch. A global descriptor for the entire protein surface is then constructed by combining information from the local descriptors. Our method is novel in its focus on residue-specific distance distributions, and the use of residue-distance co-occurrences as the basis for the proposed protein surface descriptors. Results. Results are presented for protein classification and for retrieval for three protein families. For the three families, we obtained an area under the curve for precision and recall ranging from 0.6494 (without residue co-occurrences) to 0.6683 (with residue co-occurrences). Large-scale screening using two other protein families placed related family members at the top of the rank, with a number of uncharacterized proteins also retrieved. Comparative results with other proposed methods are included

    Levels of Angiotensin-Converting Enzyme and Apolipoproteins Are Associated with Alzheimer’s Disease and Cardiovascular Diseases

    Get PDF
    Angiotensin-converting enzyme-1 (ACE1) and apolipoproteins (APOs) may play important roles in the development of Alzheimer’s disease (AD) and cardiovascular diseases (CVDs). This study aimed to examine the associations of AD, CVD, and endocrine-metabolic diseases (EMDs) with the levels of ACE1 and 9 APO proteins (ApoAI, ApoAII, ApoAIV, ApoB, ApoCI, ApoCIII, ApoD, ApoE, and ApoH). Non-Hispanic white individuals including 109 patients with AD, 356 mild cognitive impairment (MCI), 373 CVD, 198 EMD and controls were selected from the Alzheimer’s Disease Neuroimaging Initiative (ADNI) dataset. Multivariable general linear model (GLM) was used to examine the associations. ApoE ε4 allele was associated with AD, as well as ApoAIV, ApoB and ApoE proteins, but not associated with CVD and EMD. Both AD and CVD were associated with levels of ACE1, ApoB, and ApoH proteins. AD, MCI and EMD were associated with levels of ACE1, ApoAII, and ApoE proteins. This is the first study to report associations of ACE1 and several APO proteins with AD, MCI, CVD and EMD, respectively, including upregulated and downregulated protein levels. In conclusion, as specific or shared biomarkers, the levels of ACE1 and APO proteins are implicated for AD, CVD, EMD and ApoE ε4 allele. Further studies are required for validation to establish reliable biomarkers for these health condition
    corecore