The evolution of DNA sequences can be described by discrete state continuous time Markov processes on a phylogenetic tree. We consider neighbor-dependent evolutionary models where the instantaneous ...

We propose a simple model for interaction between gene candidates in the two strands of bacterial DNA (deoxyribonucleic acid). Our model assumes that 'final' genes appear in one of the two strands, ...

Extracting regulatory motifs 1 from DNA sequences seems to be all the rage these days. Take your favorite cluster of coexpressed genes, and with some luck you might hope to find a short pattern of ...

Algorithms that identify influential people in social networks can help maximize the reach of messages, but a modeling study published in PNAS Nexus shows that those same algorithms can disseminate ...

From public health campaigns to information about social services, algorithms that identify “influencers” have been used to maximize reach. Vedran Sekara and colleagues used the independent cascade ...