Zobrazeno 1 - 10
of 160
pro vyhledávání: '"Guillaume Fertin"'
Autor:
Grégoire Prunier, Mehdi Cherkaoui, Albane Lysiak, Olivier Langella, Mélisande Blein-Nicolas, Virginie Lollier, Emile Benoist, Géraldine Jean, Guillaume Fertin, Hélène Rogniaux, Dominique Tessier
Publikováno v:
BMC Bioinformatics, Vol 24, Iss 1, Pp 1-17 (2023)
Abstract Background In proteomics, the interpretation of mass spectra representing peptides carrying multiple complex modifications remains challenging, as it is difficult to strike a balance between reasonable execution time, a limited number of fal
Externí odkaz:
https://doaj.org/article/e557a1cbf29a4f44a25e328306201caf
Publikováno v:
mSystems, Vol 7, Iss 4 (2022)
ABSTRACT Metagenome-assembled genomes (MAGs) represent individual genomes recovered from metagenomic data. MAGs are extremely useful to analyze uncultured microbial genomic diversity, as well as to characterize associated functional and metabolic pot
Externí odkaz:
https://doaj.org/article/d97fab073f114512b3a0027e29b7d649
Publikováno v:
BMC Bioinformatics, Vol 22, Iss S2, Pp 1-17 (2021)
Abstract Background Mass spectrometry remains the privileged method to characterize proteins. Nevertheless, most of the spectra generated by an experiment remain unidentified after their analysis, mostly because of the modifications they carry. Open
Externí odkaz:
https://doaj.org/article/a15edb81d31d4a378a39cce35f967f22
Publikováno v:
Algorithms for Molecular Biology, Vol 14, Iss 1, Pp 1-17 (2019)
Abstract Background The evolutionary distance between two genomes can be estimated by computing a minimum length sequence of operations, called genome rearrangements, that transform one genome into another. Usually, a genome is modeled as an ordered
Externí odkaz:
https://doaj.org/article/15ad0e595ef6452cb7dd98446a000dca
Publikováno v:
Algorithms for Molecular Biology, Vol 13, Iss 1, Pp 1-16 (2018)
Abstract Background One way to estimate the evolutionary distance between two given genomes is to determine the minimum number of large-scale mutations, or genome rearrangements, that are necessary to transform one into the other. In this context, ge
Externí odkaz:
https://doaj.org/article/b659a13a7a80491eade69686c8b0e0af
Publikováno v:
Algorithms, Vol 14, Iss 6, p 169 (2021)
A multi-cut rearrangement of a string S is a string S′ obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string X1·X2·X3·…·Xk·Xk+1, where
Externí odkaz:
https://doaj.org/article/672f3178b5d349728d627b475a124380
Publikováno v:
Algorithms for Molecular Biology, Vol 12, Iss 1, Pp 1-11 (2017)
Abstract Background Combinatorial works on genome rearrangements have so far ignored the influence of intergene sizes, i.e. the number of nucleotides between consecutive genes, although it was recently shown decisive for the accuracy of inference met
Externí odkaz:
https://doaj.org/article/abe9f1999000470cad119b66d0fca515
Publikováno v:
Algorithms, Vol 8, Iss 4, Pp 810-831 (2015)
Subnetwork mining is an essential issue in the analysis of biological, social and communication networks. Recent applications require the simultaneous mining of several networks on the same or a similar vertex set. That is, one searches for subnetwor
Externí odkaz:
https://doaj.org/article/9c51d26d6dd34436bfa61d55b61aa5e7
Autor:
Guillaume Fertin, André Raspaud
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
An acyclic coloring of a graph $G$ is a coloring of its vertices such that: (i) no two neighbors in $G$ are assigned the same color and (ii) no bicolored cycle can exist in $G$. The acyclic chromatic number of $G$ is the least number of colors necess
Externí odkaz:
https://doaj.org/article/ac062353e563450fba3f10ff48e5a5d3
A comprehensive survey of a rapidly expanding field of combinatorial optimization, mathematically oriented but offering biological explanations when required.From one cell to another, from one individual to another, and from one species to another, t