0000000000005128

AUTHOR

Stéphane Chrétien

showing 10 related works from this author

Simulation-based estimation of branching models for LTR retrotransposons

2017

Abstract Motivation LTR retrotransposons are mobile elements that are able, like retroviruses, to copy and move inside eukaryotic genomes. In the present work, we propose a branching model for studying the propagation of LTR retrotransposons in these genomes. This model allows us to take into account both the positions and the degradation level of LTR retrotransposons copies. In our model, the duplication rate is also allowed to vary with the degradation level. Results Various functions have been implemented in order to simulate their spread and visualization tools are proposed. Based on these simulation tools, we have developed a first method to evaluate the parameters of this propagation …

0301 basic medicineStatistics and ProbabilitySource codeTheoretical computer scienceRetroelementsmedia_common.quotation_subjectRetrotransposon[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]BiologyBiochemistryGenomeChromosomesBranching (linguistics)[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing03 medical and health sciences[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]SoftwareAnimalsComputer SimulationMolecular BiologyComputingMilieux_MISCELLANEOUSmedia_commoncomputer.programming_languageGeneticsGenomeModels Geneticbusiness.industry[SDV.BID.EVO]Life Sciences [q-bio]/Biodiversity/Populations and Evolution [q-bio.PE]Python (programming language)[SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM][INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationComputer Science ApplicationsVisualizationComputational Mathematics030104 developmental biologyDrosophila melanogasterComputational Theory and Mathematics[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Programming Languages[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Mobile genetic elements[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businesscomputerSoftware
researchProduct

Efficient Online Laplacian Eigenmap Computation for Dimensionality Reduction in Molecular Phylogeny via Optimisation on the Sphere

2019

Reconstructing the phylogeny of large groups of large divergent genomes remains a difficult problem to solve, whatever the methods considered. Methods based on distance matrices are blocked due to the calculation of these matrices that is impossible in practice, when Bayesian inference or maximum likelihood methods presuppose multiple alignment of the genomes, which is itself difficult to achieve if precision is required. In this paper, we propose to calculate new distances for randomly selected couples of species over iterations, and then to map the biological sequences in a space of small dimension based on the partial knowledge of this genome similarity matrix. This mapping is then used …

0303 health sciences[STAT.AP]Statistics [stat]/Applications [stat.AP]Computer scienceDimensionality reductionComputationDimension (graph theory)Complete graphMinimum spanning treeBayesian inferenceQuantitative Biology::Genomics03 medical and health sciencesComputingMethodologies_PATTERNRECOGNITION0302 clinical medicine[STAT.ML]Statistics [stat]/Machine Learning [stat.ML]Algorithm030217 neurology & neurosurgeryEigenvalues and eigenvectorsDistance matrices in phylogenyComputingMilieux_MISCELLANEOUS030304 developmental biology
researchProduct

Average Performance Analysis of the Stochastic Gradient Method for Online PCA

2019

International audience; This paper studies the complexity of the stochastic gradient algorithm for PCA when the data are observed in a streaming setting. We also propose an online approach for selecting the learning rate. Simulation experiments confirm the practical relevance of the plain stochastic gradient approach and that drastic improvements can be achieved by learning the learning rate.

Computer Science::Machine Learning[STAT.ML]Statistics [stat]/Machine Learning [stat.ML]Computer science0502 economics and business05 social sciencesMathematicsofComputing_NUMERICALANALYSISRelevance (information retrieval)050207 economics010501 environmental sciencesStochastic gradient method01 natural sciencesAlgorithm0105 earth and related environmental sciences
researchProduct

SpCLUST: Towards a fast and reliable clustering for potentially divergent biological sequences

2019

International audience; This paper presents SpCLUST, a new C++ package that takes a list of sequences as input, aligns them with MUSCLE, computes their similarity matrix in parallel and then performs the clustering. SpCLUST extends a previously released software by integrating additional scoring matrices which enables it to cover the clustering of amino-acid sequences. The similarity matrix is now computed in parallel according to the master/slave distributed architecture, using MPI. Performance analysis, realized on two real datasets of 100 nucleotide sequences and 1049 amino-acids ones, show that the resulting library substantially outperforms the original Python package. The proposed pac…

0301 basic medicineComputer science[INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE]Health Informatics[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE][INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing03 medical and health sciences[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]0302 clinical medicineSoftware[INFO.INFO-ET] Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC] Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Cluster AnalysisHumansCluster analysis[INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]computer.programming_languagebusiness.industry[INFO.INFO-IU] Computer Science [cs]/Ubiquitous ComputingSimilarity matrixPattern recognitionDNAGenomicsSequence Analysis DNAPython (programming language)Mixture model[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationSpectral clusteringComputer Science Applications030104 developmental biologyComputingMethodologies_PATTERNRECOGNITION[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA][INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-MA] Computer Science [cs]/Multiagent Systems [cs.MA][INFO.INFO-MO] Computer Science [cs]/Modeling and SimulationArtificial intelligence[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businesscomputerAlgorithmsSoftware030217 neurology & neurosurgery
researchProduct

Online shortest paths with confidence intervals for routing in a time varying random network

2018

International audience; The increase in the world's population and rising standards of living is leading to an ever-increasing number of vehicles on the roads, and with it ever-increasing difficulties in traffic management. This traffic management in transport networks can be clearly optimized by using information and communication technologies referred as Intelligent Transport Systems (ITS). This management problem is usually reformulated as finding the shortest path in a time varying random graph. In this article, an online shortest path computation using stochastic gradient descent is proposed. This routing algorithm for ITS traffic management is based on the online Frank-Wolfe approach.…

FOS: Computer and information sciencesMathematical optimizationComputer sciencePopulation02 engineering and technology[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE][INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[SPI]Engineering Sciences [physics][INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]0502 economics and business11. SustainabilityComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringFOS: MathematicsData Structures and Algorithms (cs.DS)educationIntelligent transportation systemMathematics - Optimization and ControlRandom graph050210 logistics & transportationeducation.field_of_studyStochastic process[SPI.PLASMA]Engineering Sciences [physics]/Plasmas05 social sciencesApproximation algorithm[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationStochastic gradient descentOptimization and Control (math.OC)[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Shortest path problem020201 artificial intelligence & image processing[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Routing (electronic design automation)[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]
researchProduct

High-overtone bulk acoustic resonator as passive ground penetrating RADAR cooperative targets

2013

International audience; RAdio-frequency Detection And Ranging instruments—RADARs—are widely used for applications aimed at measuring passive target velocity or ranging for various metrology applications such as ground position and localization. Within the context of using piezoelectric acoustic passive sensors as cooperative targets to RADARs probed through a radiofrequency link, this paper reports on investigating the compatibility of narrowband resonator architectures with the classical operation mode of wideband RADAR instruments. Since single mode resonators are hardly compatible due to the limited bandwidth of their spectrum, the investigation has been extended to High-overtone Bulk Ac…

PhysicsPulse-Doppler radarAcousticsGeneral Physics and Astronomy020206 networking & telecommunications02 engineering and technology021001 nanoscience & nanotechnologylaw.inventionPassive radarContinuous-wave radar[SDU] Sciences of the Universe [physics]Frequency combResonatorRadar engineering detailslaw[SDU]Sciences of the Universe [physics]0202 electrical engineering electronic engineering information engineeringClutterRadar0210 nano-technology[ SDU ] Sciences of the Universe [physics]
researchProduct

Dendrochemical assessment of mercury releases from a pond and dredged-sediment landfill impacted by a chlor-alkali plant.

2016

International audience; Although current Hg emissions from industrial activities may be accurately monitored, evidence of past releases to the atmosphere must rely on one or more environmental proxies. We used Hg concentrations in tree cores collected from poplars and willows to investigate the historical changes of Hg emissions from a dredged sediment landfill and compared them to a nearby control location. Our results demonstrated the potential value of using dendrochemistry to record historical Hg emissions from past industrial activities.

Geologic Sediments010504 meteorology & atmospheric scienceschemistry.chemical_elementIndustrial Waste[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]010501 environmental sciencesGeologic SedimentsAlkalies01 natural sciencesBiochemistryIndustrial waste[ SDV.EE ] Life Sciences [q-bio]/Ecology environmentTrees[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]Waste Disposal Facilityddc:550Salicaceous speciesPondsComputingMilieux_MISCELLANEOUS0105 earth and related environmental sciencesGeneral Environmental Science[SDV.EE]Life Sciences [q-bio]/Ecology environmentChlor-alkali plantEcologyTree ringsSalixMercury[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationMercury (element)Waste Disposal FacilitiesPopuluschemistry13. Climate action[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Environmental chemistryEnvironmental scienceDendrochemistry[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Environmental Pollutants[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Environmental research
researchProduct

Multivariate GARCH estimation via a Bregman-proximal trust-region method

2011

The estimation of multivariate GARCH time series models is a difficult task mainly due to the significant overparameterization exhibited by the problem and usually referred to as the "curse of dimensionality". For example, in the case of the VEC family, the number of parameters involved in the model grows as a polynomial of order four on the dimensionality of the problem. Moreover, these parameters are subjected to convoluted nonlinear constraints necessary to ensure, for instance, the existence of stationary solutions and the positive semidefinite character of the conditional covariance matrices used in the model design. So far, this problem has been addressed in the literature only in low…

Statistics and ProbabilityMathematical optimizationPolynomialComputer scienceDiagonalComputational Finance (q-fin.CP)[QFIN.CP]Quantitative Finance [q-fin]/Computational Finance [q-fin.CP]FOS: Economics and businessQuantitative Finance - Computational FinanceDimension (vector space)0502 economics and business91G70 65C60050207 economicsMathematics050205 econometrics Trust regionStatistical Finance (q-fin.ST)Series (mathematics)Applied Mathematics05 social sciencesConstrained optimizationQuantitative Finance - Statistical Finance[QFIN.ST]Quantitative Finance [q-fin]/Statistical Finance [q-fin.ST]Computational MathematicsNonlinear systemComputational Theory and MathematicsParametrizationCurse of dimensionality
researchProduct

Finding optimal finite biological sequences over finite alphabets: the OptiFin toolbox

2017

International audience; In this paper, we present a toolbox for a specific optimization problem that frequently arises in bioinformatics or genomics. In this specific optimisation problem, the state space is a set of words of specified length over a finite alphabet. To each word is associated a score. The overall objective is to find the words which have the lowest possible score. This type of general optimization problem is encountered in e.g 3D conformation optimisation for protein structure prediction, or largest core genes subset discovery based on best supported phylogenetic tree for a set of species. In order to solve this problem, we propose a toolbox that can be easily launched usin…

FOS: Computer and information sciences0301 basic medicineTheoretical computer scienceOptimization problemComputer Science - Artificial IntelligenceComputer science[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]Quantitative Biology - Quantitative MethodsSet (abstract data type)[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing03 medical and health sciences[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]State spaceMetaheuristicQuantitative Methods (q-bio.QM)Protein structure prediction[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationToolboxCore (game theory)Artificial Intelligence (cs.AI)030104 developmental biology[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]FOS: Biological sciences[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Word (computer architecture)
researchProduct

A clustering package for nucleotide sequences using Laplacian Eigenmaps and Gaussian Mixture Model.

2018

International audience; In this article, a new Python package for nucleotide sequences clustering is proposed. This package, freely available on-line, implements a Laplacian eigenmap embedding and a Gaussian Mixture Model for DNA clustering. It takes nucleotide sequences as input, and produces the optimal number of clusters along with a relevant visualization. Despite the fact that we did not optimise the computational speed, our method still performs reasonably well in practice. Our focus was mainly on data analytics and accuracy and as a result, our approach outperforms the state of the art, even in the case of divergent sequences. Furthermore, an a priori knowledge on the number of clust…

0301 basic medicineNematoda01 natural sciencesGaussian Mixture Model[STAT.ML]Statistics [stat]/Machine Learning [stat.ML][MATH.MATH-ST]Mathematics [math]/Statistics [math.ST]ComputingMilieux_MISCELLANEOUScomputer.programming_language[STAT.AP]Statistics [stat]/Applications [stat.AP]Phylogenetic treeDNA ClusteringGenomicsHelminth ProteinsComputer Science Applications[STAT]Statistics [stat]010201 computation theory & mathematics[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Data analysisEmbeddingA priori and a posteriori[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Health Informatics0102 computer and information sciences[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]Biology[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing03 medical and health sciences[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]Laplacian EigenmapsAnimalsCluster analysis[SDV.GEN]Life Sciences [q-bio]/GeneticsModels Geneticbusiness.industryPattern recognitionNADH DehydrogenaseSequence Analysis DNAPython (programming language)Mixture model[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationVisualization030104 developmental biologyComputingMethodologies_PATTERNRECOGNITIONPlatyhelminths[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Programming LanguagesArtificial intelligence[INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM]businesscomputerComputers in biology and medicine
researchProduct