Search results for "algorithm."

showing 10 items of 4617 documents

The Myriad Virtues of Wavelet Trees

2009

Wavelet Trees have been introduced in [Grossi, Gupta and Vitter, SODA '03] and have been rapidly recognized as a very flexible tool for the design of compressed full-text indexes and data compressors. Although several papers have investigated the beauty and usefulness of this data structure in the full-text indexing scenario, its impact on data compression has not been fully explored. In this paper we provide a complete theoretical analysis of a wide class of compression algorithms based on Wavelet Trees. We also show how to improve their asymptotic performance by introducing a novel framework, called Generalized Wavelet Trees, that aims for the best combination of binary compressors (like,…

Binary treeWeight-balanced treeWavelet transformCascade algorithmData_CODINGANDINFORMATIONTHEORYHuffman codingData CompressionTheoretical Computer ScienceComputer Science ApplicationsSet partitioning in hierarchical treessymbols.namesakeWaveletComputational Theory and Mathematicssymbolsempirical entropyBurrows-Wheeler TransformAlgorithmData compressionMathematicsInformation SystemsWavelet Trees
researchProduct

Concentration and energy fluctuations in a critical polymer mixture

1995

A semi-grand-canonical Monte Carlo algorithm is employed in conjunction with the bond fluctuation model to investigate the critical properties of an asymmetric binary (AB) polymer mixture. By applying the equal peak-weight criterion to the concentration distribution, the coexistence curve separating the A-rich and B-rich phases is identified as a function of temperature and chemical potential. To locate the critical point of the model, the cumulant intersection method is used. The accuracy of this approach for determining the critical parameters of fluids is assessed. Attention is then focused on the joint distribution function of the critical concentration and energy, which is analysed usi…

BinodalCritical point (thermodynamics)Critical phenomenaCondensed Matter (cond-mat)FOS: Physical sciencesIsing modelCondensed MatterStatistical physicsRenormalization groupCritical dimensionCritical exponentMonte Carlo algorithmMathematics
researchProduct

An optical water type framework for selecting and blending retrievals from bio-optical algorithms in lakes and coastal waters.

2014

Bio-optical models are based on relationships between the spectral remote sensing reflectance and optical properties of in-water constituents. The wavelength range where this information can be exploited changes depending on the water characteristics. In low chlorophyll-a waters, the blue/green region of the spectrum is more sensitive to changes in chlorophyll-a concentration, whereas the red/NIR region becomes more important in turbid and/or eutrophic waters. In this work we present an approach to manage the shift from blue/green ratios to red/NIR-based chlorophyll-a algorithms for optically complex waters. Based on a combined in situ data set of coastal and inland waters, measures of over…

Bio opticalWavelength rangeRemote sensing reflectanceSoil ScienceGeologyArticleData setApproximation errorOcean colorEnvironmental scienceComputers in Earth SciencesRoot-mean-square deviationAlgorithmRemote sensingRemote sensing of environment
researchProduct

Bio-inspired security analysis for IoT scenarios

2020

Computer security has recently become more and more important as the world economy dependency from data has kept growing. The complexity of the systems that need to be kept secure calls for new models capable of abstracting the interdependencies among heterogeneous components that cooperate at providing the desired service. A promising approach is attack graph analysis, however, the manual analysis of attack graphs is tedious and error prone. In this paper we propose to apply the metabolic network model to attack graph analysis, using three interacting bio-inspired algorithms: topological analysis, flux balance analysis, and extreme pathway analysis. A developed framework for graph building…

Bio-inspired techniqueService (systems architecture)Security analysisIoTDependency (UML)Computer scienceNetwork securityDistributed computingmedia_common.quotation_subject0211 other engineering and technologies02 engineering and technologyMetabolic networksAttack graphs; Bio-inspired algorithms; Bio-inspired techniques; IoT; Metabolic networks; Network security; Security analysis; System securityAttack graph03 medical and health sciences0302 clinical medicineUse casemedia_common021110 strategic defence & security studiesSecurity analysisbusiness.industryMetabolic network030208 emergency & critical care medicineBio-inspired techniquesNetwork securitySystem securityFlux balance analysisInterdependenceHardware and ArchitectureBio-inspired algorithmGraph (abstract data type)businessSoftwareAttack graphsBio-inspired algorithms
researchProduct

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…

BioinformaticSparkSettore INF/01 - InformaticaExploitbusiness.industryComputer scienceBioinformaticsDistributed computingScalabilityAlgorithm engineeringField (computer science)Distributed computingSoftwareAlgorithm engineering; Bioinformatics; Distributed computing; Hadoop; MapReduce; Scalability; SparkHadoopSpark (mathematics)ScalabilityData-intensive computingMapReducebusinessImplementationAlgorithm engineering
researchProduct

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…

BioinformaticsHealth InformaticsMicroarray data analysisRobustness (computer science)Databases GeneticCluster AnalysisHumansManifoldsCluster analysisMathematicsOligonucleotide Array Sequence Analysisbusiness.industryDimensionality reductionGene Expression ProfilingComputational BiologyDiscriminant AnalysisPattern recognitionSparse approximationLinear discriminant analysisManifoldComputer Science ApplicationsFISICA APLICADAEmbeddingAutomatic classificationArtificial intelligencebusinessGlioblastomaMeningiomaTranscriptomeAlgorithmsCurse of dimensionalityComputers in biology and medicine
researchProduct

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…

Biologycomputer.software_genreBioinformatics network analysis co-clusteringTask (project management)Set (abstract data type)Protein Interaction MappingGeneticsCluster (physics)Cluster AnalysisHumansRelevance (information retrieval)Protein Interaction MapsCluster analysisStructure (mathematical logic)Applied MathematicsProteinsprotein-protein interaction networksbiological networksComputingMethodologies_PATTERNRECOGNITIONCover (topology)Co-clusteringData miningcomputerAlgorithmsBiological networkBiotechnologyIEEE/ACM Transactions on Computational Biology and Bioinformatics
researchProduct

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…

Biologylcsh:Computer applications to medicine. Medical informaticsDNA-binding proteinGenomeBiochemistryDNA sequencingCell Line03 medical and health scienceschemistry.chemical_compound0302 clinical medicineStructural BiologyHumansTranscription factorMolecular Biologylcsh:QH301-705.5Sequence Specificity Epigenomics Bioinformatics030304 developmental biologyEpigenomicsGenetics0303 health sciencesBase SequenceSettore INF/01 - InformaticaGenome HumanApplied MathematicsMethodology ArticleDNAComputer Science ApplicationsDNA-Binding Proteinschemistrylcsh:Biology (General)lcsh:R858-859.7Human genomeDNA microarray030217 neurology & neurosurgeryDNAAlgorithmsSoftwareGenome-Wide Association StudyProtein BindingTranscription FactorsBMC Bioinformatics
researchProduct

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…

Biomedical EngineeringArthritisElectromyographyMachine learningcomputer.software_genreGait (human)Musculoskeletal disorderArtificial IntelligenceInternal MedicineHumansMedicineGaitArtificial neural networkmedicine.diagnostic_testElectromyographybusiness.industryArthritisData CollectionGeneral NeuroscienceRehabilitationReproducibility of ResultsSignal Processing Computer-AssistedLinear discriminant analysismedicine.diseaseBiomechanical PhenomenaKernel methodROC CurveMultilayer perceptronArtificial intelligencebusinesscomputerAlgorithmAlgorithmsIEEE Transactions on Neural Systems and Rehabilitation Engineering
researchProduct

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…

Biomedical EngineeringBlood PressureBivariate analysisDirectionalitySensitivity and SpecificitySurrogate dataFeedbackNonlinear parametric modelGranger causalityControl theoryHeart RateOptimal parameter searchStatisticsAnimalsHumansComputer SimulationPredictabilityHeart rate variabilityMathematicsNonlinear autoregressive exogenous modelCardiovascular regulationSystem identificationModels CardiovascularNonlinear systemAutoregressive modelNonlinear DynamicsAutoregressive exogenous modelSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaRegression AnalysisSurrogate dataArterial pressure variabilityAlgorithmsAnnals of biomedical engineering
researchProduct