Graph editing to a fixed target

For a fixed graph H, the H-Minor Edit problem takes as input a graph G and an integer k and asks whether G can be modified into H by a total of at most k edge contractions, edge deletions and vertex deletions. Replacing edge contractions by vertex dissolutions yields the H-Topological Minor Edit problem. For each problem we show polynomial-time solvable and NP-complete cases depending on the choice of H. Moreover, when G is AT-free, chordal or planar, we show that H-Minor Edit is polynomial-time solvable for all graphs H

Efficient exact pattern-matching in proteomic sequences

This paper proposes a novel algorithm for complete exact pattern-matching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficient considering larger alphabets. The searching strategy uses large search windows allowing multiple alignments per iteration. A new filtering heuristic, named compatibility rule, contributed decisively to the efficiency improvement. The new algorithm’s performance is, on average, superior in comparison with its best-rated competitors

Bipolar distribution of deep-sea benthic foraminifera

Abstrac

Bit-parallel search algorithms for long patterns

Peer reviewe

Eukaryotic richness in the abyss: insights from pyrotag sequencing

Background: The deep sea floor is considered one of the most diverse ecosystems on Earth. Recent environmental DNA surveys based on clone libraries of rRNA genes confirm this observation and reveal a high diversity of eukaryotes present in deep-sea sediment samples. However, environmental clone-library surveys yield only a modest number of sequences with which to evaluate the diversity of abyssal eukaryotes. Methodology/Principal Findings: Here, we examined the richness of eukaryotic DNA in deep Arctic and Southern Ocean samples using massively parallel sequencing of the 18S ribosomal RNA (rRNA) V9 hypervariable region. In very small volumes of sediments, ranging from 0.35 to 0.7 g, we recovered up to 7,499 unique sequences per sample. By clustering sequences having up to 3 differences, we observed from 942 to 1756 Operational Taxonomic Units (OTUs) per sample. Taxonomic analyses of these OTUs showed that DNA of all major groups of eukaryotes is represented at the deep-sea floor. The dinoflagellates, cercozoans, ciliates, and euglenozoans predominate, contributing to 17%, 16%, 10%, and 8% of all assigned OTUs, respectively. Interestingly, many sequences represent photosynthetic taxa or are similar to those reported from the environmental surveys of surface waters. Moreover, each sample contained from 31 to 71 different metazoan OTUs despite the small sample volume collected. This indicates that a significant faction of the eukaryotic DNA sequences likely do not belong to living organisms, but represent either free, extracellular DNA or remains and resting stages of planktonic species. Conclusions/Significance: In view of our study, the deep-sea floor appears as a global DNA repository, which preserves genetic information about organisms living in the sediment, as well as in the water column above it. This information can be used for future monitoring of past and present environmental changes.French ANR Aquaparadox; ANR DeepOases; Swiss National Science Foundation [31003A-125372]; WM Keck foundationinfo:eu-repo/semantics/publishedVersio

Approximate string matching with reduced alphabet

Peer reviewe

Managing large-scale genomic datasets and translation into clinical practice.

International audienceTo summarize excellent current research in the field of Bioinformatics and Translational Informatics with application in the health domain