Search results for "ALGORITHM"
showing 10 items of 4887 documents
Mapreduce in computational biology via hadoop and spark
2017
Bioinformatics has a long history of software solutions developed on multi-core computing systems for solving computational intensive problems. This option suffer from some issues solvable by shifting to Distributed Systems. In particular, the MapReduce computing paradigm, and its implementations, Hadoop and Spark, is becoming increasingly popular in the Bioinformatics field because it allows for virtual-unlimited horizontal scalability while being easy-to-use. Here we provide a qualitative evaluation of some of the most significant MapReduce bioinformatics applications. We also focus on one of these applications to show the importance of correctly engineering an application to fully exploi…
Sparse Manifold Clustering and Embedding to discriminate gene expression profiles of glioblastoma and meningioma tumors.
2013
Sparse Manifold Clustering and Embedding (SMCE) algorithm has been recently proposed for simultaneous clustering and dimensionality reduction of data on nonlinear manifolds using sparse representation techniques. In this work, SMCE algorithm is applied to the differential discrimination of Glioblastoma and Meningioma Tumors by means of their Gene Expression Profiles. Our purpose was to evaluate the robustness of this nonlinear manifold to classify gene expression profiles, characterized by the high-dimensionality of their representations and the low discrimination power of most of the genes. For this objective, we used SMCE to reduce the dimensionality of a preprocessed dataset of 35 single…
A Coclustering Approach for Mining Large Protein-Protein Interaction Networks
2012
Several approaches have been presented in the literature to cluster Protein-Protein Interaction (PPI) networks. They can be grouped in two main categories: those allowing a protein to participate in different clusters and those generating only nonoverlapping clusters. In both cases, a challenging task is to find a suitable compromise between the biological relevance of the results and a comprehensive coverage of the analyzed networks. Indeed, methods returning high accurate results are often able to cover only small parts of the input PPI network, especially when low-characterized networks are considered. We present a coclustering-based technique able to generate both overlapping and nonove…
A motif-independent metric for DNA sequence specificity
2011
Abstract Background Genome-wide mapping of protein-DNA interactions has been widely used to investigate biological functions of the genome. An important question is to what extent such interactions are regulated at the DNA sequence level. However, current investigation is hampered by the lack of computational methods for systematic evaluating sequence specificity. Results We present a simple, unbiased quantitative measure for DNA sequence specificity called the Motif Independent Measure (MIM). By analyzing both simulated and real experimental data, we found that the MIM measure can be used to detect sequence specificity independent of presence of transcription factor (TF) binding motifs. We…
The Application of Machine Learning Algorithms to the Analysis of Electromyographic Patterns From Arthritic Patients
2009
The main aim of our study was to investigate the possibility of applying machine learning techniques to the analysis of electromyographic patterns (EMG) collected from arthritic patients during gait. The EMG recordings were collected from the lower limbs of patients with arthritis and compared with those of healthy subjects (CO) with no musculoskeletal disorder. The study involved subjects suffering from two forms of arthritis, viz, rheumatoid arthritis (RA) and hip osteoarthritis (OA). The analysis of the data was plagued by two problems which frequently render the analysis of this type of data extremely difficult. One was the small number of human subjects that could be included in the in…
Assessment of Granger causality by nonlinear model identification: application to short-term cardiovascular variability.
2007
A method for assessing Granger causal relationships in bivariate time series, based on nonlinear autoregressive (NAR) and nonlinear autoregressive exogenous (NARX) models is presented. The method evaluates bilateral interactions between two time series by quantifying the predictability improvement (PI) of the output time series when the dynamics associated with the input time series are included, i.e., moving from NAR to NARX prediction. The NARX model identification was performed by the optimal parameter search (OPS) algorithm, and its results were compared to the least-squares method to determine the most appropriate method to be used for experimental data. The statistical significance of…
Mutual nonlinear prediction of cardiovascular variability series: Comparison between exogenous and autoregressive exogenous models
2007
A model-based approach to perform mutual nonlinear prediction of short cardiovascular variability series is presented. The approach is based on identifying exogenous (X) and autoregressive exogenous (ARX) models by K-nearest neighbors local linear approximation, and estimates the predictability of a series given the other as the squared correlation between original and predicted values of the series. The method was first tested on simulations reproducing different types of interaction between non-identical Henon maps, and then applied to heart rate (HR) and blood pressure (BP) variability series measured in healthy subjects at rest and after head-up tilt. Simulations showed that different c…
Bivariate nonlinear prediction to quantify the strength of complex dynamical interactions in short-term cardiovascular variability.
2005
A nonlinear prediction method for investigating the dynamic interdependence between short length time series is presented. The method is a generalization to bivariate prediction of the univariate approach based on nearest neighbor local linear approximation. Given the input and output series x and y, the relationship between a pattern of samples of x and a synchronous sample of y was approximated with a linear polynomial whose coefficients were estimated from an equation system including the nearest neighbor patterns in x and the corresponding samples in y. To avoid overfitting and waste of data, the training and testing stages of the prediction were designed through a specific out-of-sampl…
A Robust Generic Method for Grid Detection in White Light Microscopy Malassez Blade Images in the Context of Cell Counting
2015
AbstractIn biology, cell counting is a primary measurement and it is usually performed manually using hemocytometers such as Malassez blades. This work is tedious and can be automated using image processing. An algorithm based on Fourier transform filtering and the Hough transform was developed for Malassez blade grid extraction. This facilitates cell segmentation and counting within the grid. For the present work, a set of 137 images with high variability was processed. Grids were accurately detected in 98% of these images.
Automatic program for peak detection and deconvolution of multi-overlapped chromatographic signals
2005
Several interlinked algorithms for peak deconvolution by non-linear regression are presented. These procedures, together with the peak detection methods outlined in Part I, have allowed the implementation of an automatic method able to process multi-overlapped signals, requiring little user interaction. A criterion based on the evaluation of the multivariate selectivity of the chromatographic signal is used to auto-select the most efficient deconvolution procedure for each chromatographic situation. In this way, non-optimal local solutions are avoided in cases of high overlap, and short computation times are obtained in situations of high resolution. A new algorithm, fitting both the origin…