|
|
|
|
| LEADER |
01308 am a22002173u 4500 |
| 001 |
99967 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Roch, Sebastien
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Daskalakis, Konstantinos
|e contributor
|
| 700 |
1 |
0 |
|a Daskalakis, Konstantinos
|e author
|
| 245 |
0 |
0 |
|a Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
|
| 260 |
|
|
|b Institute of Mathematical Statistics,
|c 2015-11-20T18:15:30Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/99967
|
| 520 |
|
|
|a We present an efficient phylogenetic reconstruction algorithm allowing insertions and deletions which provably achieves a sequence-length requirement (or sample complexity) growing polynomially in the number of taxa. Our algorithm is distance-based, that is, it relies on pairwise sequence comparisons. More importantly, our approach largely bypasses the difficult problem of multiple sequence alignment.
|
| 520 |
|
|
|a Alfred P. Sloan Foundation (Fellowship)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (CAREER Award CCF-0953960)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (Award CCF-1101491)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t The Annals of Applied Probability
|
