Approximation par arbres d'une distance partielle
In tree clustering, we try to approximate a given dissimilarity matrice by a tree distance. In some cases, especially when comparing biological séquences, some dissimilarity values cannot be evaluated and we get some partial dissimilarity with undefined values. In that case one can develop a sequent...
Kaydedildi:
| Yayımlandı: | URI:https://journals.openedition.org/msh, |
|---|---|
| Asıl Yazarlar: | , |
| Materyal Türü: | Article ou chapitre numérique |
| Dil: | Français |
| Baskı/Yayın Bilgisi: |
Mathématiques et sciences humaines
2006
|
| Konular: | |
| Online Erişim: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |
| Özet: | In tree clustering, we try to approximate a given dissimilarity matrice by a tree distance. In some cases, especially when comparing biological séquences, some dissimilarity values cannot be evaluated and we get some partial dissimilarity with undefined values. In that case one can develop a sequential method to reconstruct a valued tree or evaluate the missing values using a tree model. This paper introduces two methods of this kind and compare them simulating noisy partial tree dissimilarities. |
|---|