ARTÍCULO
TITULO

A Polynomial-Time Algorithm for Near-Perfect Phylogeny

Fernandez-Baca    
D. Lagergren    
J.    

Resumen

No disponible

 Artículos similares

       
 
Bao Tong, Jianwei Wang, Xue Wang, Feihao Zhou, Xinhua Mao and Wenlong Zheng    
The optimal delivery route problem for truck?drone delivery is defined as a traveling salesman problem with drone (TSP-D), which has been studied in a wide range of previous literature. However, most of the existing studies ignore truck waiting time at r... ver más
Revista: Applied Sciences

 
Priyanka Sharma and Rishi Pal Singh    
Wireless underground sensor networks (WUSNs) are being used in agricultural applications, in border patrol, and in the monitoring of remote areas. Coverage holes in WUSNs are an issue which needs to be dealt with. Coverage holes may occur due to random d... ver más
Revista: Computers

 
András Faragó and Zohre R. Mojaveri    
The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various... ver más
Revista: Algorithms

 
András Faragó    
A classic and fundamental result, known as the Lovász Local Lemma, is a gem in the probabilistic method of combinatorics. At a high level, its core message can be described by the claim that weakly dependent events behave similarly to independent ones. A... ver más
Revista: Algorithms

 
David Schaller, Manuela Geiß, Marc Hellmuth and Peter F. Stadler    
Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees.... ver más
Revista: Algorithms