Author of the publication

Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees.

, , , , , , and . ISBRA, volume 7875 of Lecture Notes in Computer Science, page 112-124. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Multimedia object placement for hybrid transparent data replication., , , and . GLOBECOM, page 5. IEEE, (2005)Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate., , , , and . Math. Found. Comput., 1 (4): 383-392 (2018)Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees., , and . Trans. Computational Systems Biology, (2005)An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products.. Commun. ACM, 21 (7): 544-549 (1978)Optimal methods for coordinated enroute web caching for tree networks., , , and . ACM Trans. Internet Techn., 5 (3): 480-507 (2005)An efficient motif discovery algorithm with unknown motif length and number of binding sites., and . IJDMB, 1 (2): 201-215 (2006)A tight lower bound for job scheduling with cancellation., , , , and . Inf. Process. Lett., 97 (1): 1-3 (2006)Finding exact optimal motifs in matrix representation by partitioning., and . ECCB/JBI, page 92. (2005)Generalized Planted (l, d)-Motif Problem with Negative Set., and . WABI, volume 3692 of Lecture Notes in Computer Science, page 264-275. Springer, (2005)The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries., , , and . WABI, volume 4645 of Lecture Notes in Computer Science, page 372-382. Springer, (2007)