Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Fumei Lam"'
Autor:
Fumei Lam1 flam@cs.ucdavis.edu, Gusfield, Dan1 gusfield@cs.ucdavis.edu, Sridhar, Srinath2 srinath@cs.cmu.edu
Publikováno v:
SIAM Journal on Discrete Mathematics. 2011, Vol. 25 Issue 3/4, p1144-1175. 32p. 47 Diagrams.
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642126826
RECOMB
RECOMB
Given molecular genetic data from diploid individuals that, at present, reproduce mostly or exclusively asexually without recombination, an important problem in evolutionary biology is detecting evidence of past sexual reproduction (i.e., meiosis and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c16410381471cf3a3c8096372e541bec
https://doi.org/10.1089/cmb.2010.0270
https://doi.org/10.1089/cmb.2010.0270
Publikováno v:
SIAM Journal on Discrete Mathematics. 25:1144-1175
We study the three-state perfect phylogeny problem and show that there is a three-state perfect phylogeny for a set of input sequences if and only if there is a perfect phylogeny for every subset of three characters. In establishing these results, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73b8f3246793431ee0f2314d203dde15
https://doi.org/10.1137/090776305
https://doi.org/10.1137/090776305
Autor:
Fumei Lam, Sorin Istrail
Publikováno v:
Commun. Inf. Syst. 9, no. 4 (2009), 303-346
We present a comprehensive survey of combinatorial algorithms and theorems about lattice protein folding models obtained in the almost 15 years since the publication in 1995 of the first protein folding approximation algorithm with mathematically gua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f40ddf02ca78cfef476c2963684a3c3
https://doi.org/10.4310/cis.2009.v9.n4.a2
https://doi.org/10.4310/cis.2009.v9.n4.a2
Autor:
Fumei Lam, Alantha Newman
Publikováno v:
Mathematical Programming. 113:39-59
In the traveling salesman path problem, we are given a set of cities, traveling costs between city pairs and fixed source and destination cities. The objective is to find a minimum cost path from the source to destination visiting all cities exactly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6355901553a1c1d4ec303bf80dd60a5
https://doi.org/10.1007/s10107-006-0046-8
https://doi.org/10.1007/s10107-006-0046-8
Publikováno v:
Journal of Computational Biology. 10:509-520
The application of Needleman-Wunsch alignment techniques to biological sequences is complicated by two serious problems when the sequences are long: the running time, which scales as the product of the lengths of sequences, and the difficulty in obta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3fa8300d4f24b56f4a9c0c2a93922334
https://doi.org/10.1089/10665270360688156
https://doi.org/10.1089/10665270360688156
Publikováno v:
Gysel, Rob; Lam, Fumei; & Gusfield, Dan. (2012). Constructing perfect phylogenies and proper triangulations for three-state characters. Algorithms for Molecular Biology, 7(1), 26. doi: http://dx.doi.org/10.1186/1748-7188-7-26. Retrieved from: http://www.escholarship.org/uc/item/122230dz
Algorithms for Molecular Biology : AMB
Algorithms for Molecular Biology, Vol 7, Iss 1, p 26 (2012)
Algorithms for Molecular Biology : AMB
Algorithms for Molecular Biology, Vol 7, Iss 1, p 26 (2012)
In this paper, we study the problem of constructing perfect phylogenies for three-state characters. Our work builds on two recent results. The first result states that for three-state characters, the local condition of examining all subsets of three
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9aca1a02ecd9bc524d21d5532957166
http://www.escholarship.org/uc/item/122230dz
http://www.escholarship.org/uc/item/122230dz
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642200359
RECOMB
RECOMB
We present results on two classes of problems. The first result addresses the long standing open problem of finding unifying principles for Linkage Disequilibrium (LD) measures in population genetics (Lewontin 1964 [10], Hedrick 1987 [8], Devlin and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24a3056f744cb682e860f6150c3b9ffb
https://doi.org/10.1007/978-3-642-20036-6_42
https://doi.org/10.1007/978-3-642-20036-6_42
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642230370
WABI
WABI
In this paper, we study the problem of constructing perfect phylogenies for three-state characters. Our work builds on two recent results. The first result states that for three-state characters, the local condition of examining all subsets of three
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8187b0663aa89250e8cff1951dd95f5d
https://doi.org/10.1007/978-3-642-23038-7_10
https://doi.org/10.1007/978-3-642-23038-7_10
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new advances in phylogeny inference will be required if we are to be able to co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0499864c79a0158273c34fe5b77a4e72