The following pages link to Roded Sharan (Q214971):
Displaying 26 items.
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- Haplotyping with missing data via perfect path phylogenies (Q876476) (← links)
- Prediction of phenotype information from genotype data (Q966184) (← links)
- On the complexity of SNP block partitioning under the perfect phylogeny model (Q1045048) (← links)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- Copy-number evolution problems: complexity and algorithms (Q1708426) (← links)
- Cluster graph modification problems (Q1885821) (← links)
- A sticky multinomial mixture model of strand-coordinated mutational processes in cancer (Q2415277) (← links)
- (Q2723947) (← links)
- A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs (Q2784453) (← links)
- Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification, and Population Stratification (Q2890437) (← links)
- Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations (Q2904480) (← links)
- On the Approximability of Reachability-Preserving Network Orientations (Q2909122) (← links)
- Approximation Algorithms for Orienting Mixed Graphs (Q3011872) (← links)
- (Q3024800) (← links)
- On the Generality of Phylogenies from Incomplete Directed Characters (Q3046511) (← links)
- (Q4414513) (← links)
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem (Q4507385) (← links)
- (Q4542518) (← links)
- Incomplete Directed Perfect Phylogeny (Q4651483) (← links)
- A Chemical-Distance-Based Test for Positive Darwinian Selection (Q4801147) (← links)
- Improved Orientations of Physical Networks (Q4932595) (← links)
- (Q4944968) (← links)
- A Dynamic Algorithm for Network Propagation (Q5090332) (← links)
- Reconstructing Chain Functions in Genetic Networks (Q5757389) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
