scholarly journals A Note on Online Colouring Problems in Overlap Graphs and Their Complements

Author(s):  
Marc Demange ◽  
Martin Olsen
Keyword(s):  
Author(s):  
Andrzej Ehrenfeucht ◽  
Tero Harju ◽  
Ion Petre ◽  
David M. Prescott ◽  
Grzegorz Rozenberg
Keyword(s):  

1998 ◽  
Vol 11 (2) ◽  
pp. 99-102 ◽  
Author(s):  
J. Nieminen ◽  
M. Peltola
Keyword(s):  

2011 ◽  
Vol 14 (04) ◽  
pp. 635-647 ◽  
Author(s):  
GIAN MARCO PALAMARA ◽  
VINKO ZLATIĆ ◽  
ANTONIO SCALA ◽  
GUIDO CALDARELLI

In this work we analyze the topological and dynamical properties of a simple model of complex food webs, namely the niche model. In order to underline competition among species, we introduce "prey" and "predators" weighted overlap graphs derived from the niche model and compare synthetic food webs with real data. Doing so, we find new tests for the goodness of synthetic food web models and indicate a possible direction of improvement for existing ones. We then exploit the weighted overlap graphs to define a competition kernel for Lotka–Volterra population dynamics and find that for such a model the stability of food webs decreases with its ecological complexity.


2017 ◽  
Vol 27 (5) ◽  
pp. 835-848 ◽  
Author(s):  
Jasmijn A. Baaijens ◽  
Amal Zine El Aabidine ◽  
Eric Rivals ◽  
Alexander Schönhuth

Author(s):  
Vicky Zheng ◽  
Ahmet Erdem Sariyuce ◽  
Jaroslaw Zola

AbstractWith the emergence of portable DNA sequencers, such as Oxford Nanopore Technology MinION, metagenomic DNA sequencing can be performed in real-time and directly in the field. However, because metagenomic DNA analysis is computationally and memory intensive, and the current methods are designed for batch processing, the current metagenomic tools are not well suited for mobile devices.In this paper, we propose a new memory-efficient method to identify Operational Taxonomic Units (OTUs) in metagenomic DNA streams. Our method is based on finding connected components in overlap graphs constructed over a real-time stream of long DNA reads as produced by MinION platform. We propose an efficient algorithm to maintain connected components when an overlap graph is streamed, and show how redundant information can be removed from the stream by transitive closures. Through experiments on simulated and real-world metagenomic data, we demonstrate that the resulting solution is able to recover OTUs with high precision while remaining suitable for mobile computing devices.


2008 ◽  
Vol 30 ◽  
pp. 213-218 ◽  
Author(s):  
Marc Demange ◽  
Gabriele Di Stefano ◽  
Benjamin Leroy-Beaulieu
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document