dc.contributor.author |
Solovyev V. |
|
dc.contributor.author |
Faskhutdinov R. |
|
dc.contributor.author |
Bayrasheva V. |
|
dc.date.accessioned |
2018-09-18T20:27:33Z |
|
dc.date.available |
2018-09-18T20:27:33Z |
|
dc.date.issued |
2014 |
|
dc.identifier.issn |
1865-0929 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/140101 |
|
dc.description.abstract |
© Springer International Publishing Switzerland 2014. Phylogenetic algorithms are a tool that is frequently used in biology and linguistics for reconstruction of the evolution trees for species or languages. However, there is no a definitely superior algorithm: various algorithms have shown the best results in various studies. In this paper we test four most popular algorithms. We make recommendations which algorithm is better to choose in different cases. In particular, the influence of the feasibility of the lexical clock hypothesis is shown. It is shown that the results are also affected by the choice of metric, and that the results can be improved by using the λ-measure instead of the Hamming's measure. The results of the paper are obtained using both the simulation method and real data. |
|
dc.relation.ispartofseries |
Communications in Computer and Information Science |
|
dc.subject |
Evolution trees |
|
dc.subject |
Linguistic databases |
|
dc.subject |
Measures |
|
dc.subject |
Phylogenetic algorithms |
|
dc.title |
Testing phylogenetic algorithms in linguistic databases |
|
dc.type |
Article |
|
dc.relation.ispartofseries-volume |
465 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
373 |
|
dc.source.id |
SCOPUS18650929-2014-465-SID84922019402 |
|