Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.

A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of them. Standard formulations of such problems model a solution as a path cover in a directed acyclic graph, namely a set of paths that together cover all vertices of the graph. Since multi-assembly problems admit multiple solutions in practice, we consider an approach commonly used in standard genome assembly: output only partial solutions (contigs, or safe paths), that appear in all path cover solutions.

Measuring Interoception: The CARdiac Elevation Detection Task.

Interoception has increasingly been the focus of psychiatric research, due to its hypothesized role in mental health. Existing interoceptive tasks either suffer from important methodological limitations, impacting their validity, or are burdensome and require specialized equipment, which limits their usage in vulnerable populations. We report on the development of the CARdiac Elevation Detection (CARED) task.

SDNN24 Estimation from Semi-Continuous HR Measures.

The standard deviation of the interval between QRS complexes recorded over 24 h (SDNN24) is an important metric of cardiovascular health. Wrist-worn fitness wearable devices record heart beats 24/7 having a complete overview of users' heart status. Due to motion artefacts affecting QRS complexes recording, and the different nature of the heart rate sensor used on wearable devices compared to ECG, traditionally used to compute SDNN24, the estimation of this important Heart Rate Variability (HRV) metric has never been performed from wearable data.

Analysis of the Impact of Interpolation Methods of Missing RR-intervals Caused by Motion Artifacts on HRV Features Estimations.

Wearable physiological monitors have become increasingly popular, often worn during people's daily life, collecting data 24 hours a day, 7 days a week. In the last decade, these devices have attracted the attention of the scientific community as they allow us to automatically extract information about user physiology (e.g.

Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics.

Covering alignment problems arise from recent developments in genomics; so called pan-genome graphs are replacing reference genomes, and advances in haplotyping enable full content of diploid genomes to be used as basis of sequence analysis. In this paper, we show that the computational complexity will change for natural extensions of alignments to pan-genome representations and to diploid genomes. More broadly, our approach can also be seen as a minimal extension of sequence alignment to labelled directed acyclic graphs (labeled DAGs).