http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Weyer-Menkhoff, J. (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
Δ additive and Δ ultra-additive maps, Gromov's trees, and the Farris transform
Dress, A.,Holland, B.,Huber, K.T.,Koolen, J.H.,Moulton, V.,Weyer-Menkhoff, J. Elsevier 2005 Discrete Applied Mathematics Vol.146 No.1
<P><B>Abstract</B></P><P>In phylogenetic analysis, one searches for phylogenetic trees that reflect observed similarity between a collection of species in question. To this end, one often invokes two simple facts: (i) Any tree is completely determined by the metric it induces on its leaves (which represent the species). (ii) The resulting metrics are characterized by their property of being <I>additive</I> or, in the case of dated rooted trees, <I>ultra-additive</I>. Consequently, searching for additive or ultra-additive metrics <I>A</I> that best approximate the metric <I>D</I> encoding the observed similarities is a standard task in phylogenetic analysis. Remarkably, while there are efficient algorithms for constructing optimal ultra-additive approximations, the problem of finding optimal additive approximations in the <SUB>l1</SUB> or <SUB>l∞</SUB> sense is NP-hard. In the context of the theory of δ-<I>hyperbolic</I> groups, however, good additive approximations <I>A</I> of a metric <I>D</I> were found by Gromov already in 1988 and shown to satisfy the bound∥D-A<SUB>∥∞</SUB>⩽Δ(D)⌈<SUB>log2</SUB>(#X-1)⌉,where Δ(D), the <I>hyperbolicity</I> of <I>D</I>, i.e. the maximum of all expressions of the formD(u,v)+D(x,y)-max(D(u,x)+D(v,y),D(u,y)+D(v,x))(u,v,x,y∈X). Yet, besides some notable exceptions (e.g. Adv. Appl. Math. 27 (2001) 733–767), the potential of Gromov's concept of hyperbolicity is far from being fully explored within the context of phylogenetic analysis. In this paper, we provide the basis for a systematic theory of Δ <I>ultra-additive</I> and Δ <I>additive</I> approximations. In addition, we also explore the average and worst case behavior of Gromov's bound.</P>
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
