Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Elegant Structures in Computation. To Andrzej Ehrenfeucht on His 85th Birthday
Guest editors: Gheorghe Păun, Grzegorz Rozenberg and Arto Salomaa
Article type: Research Article
Authors: Bonizzoni, Paolaa; * | Carrieri, Anna Paolab | Della Vedova, Gianlucac | Rizzi, Raffaellad | Trucco, Gabriellae
Affiliations: [a] DISCo, Università degli Studi di Milano-Bicocca, Italy. [email protected] | [b] IBM Research, UK. [email protected] | [c] DISCo, Università degli Studi di Milano-Bicocca, Italy. [email protected] | [d] DISCo, Università degli Studi di Milano-Bicocca, Italy. [email protected] | [e] Dipartimento di Informatica, Università degli Studi di Milano, Italy. [email protected]
Correspondence: [*] Address for correspondenece: DISCo, Università degli Studi di Milano-Bicocca, Italy
Abstract: The perfect phylogeny is a widely used model in phylogenetics, since it provides an effective representation of evolution of binary characters in several contexts, such as for example in haplotype inference. The model, which is conceptually the simplest among those actually used, is based on the infinite sites assumption, that is no character can mutate more than once in the whole tree. Since a large number of biological phenomena cannot be modeled by the perfect phylogeny, it becomes important to find generalizations that retain the computational tractability of the original model, but are more flexible in modeling biological data when the infinite site assumption is violated, e.g. because of back mutations. In this paper, we introduce a new model—called species-driven persistent phylogeny—and we study the relations between three different formulations: perfect phylogeny, persistent phylogeny, galled trees, and species-driven persistent phylogeny. The species-driven persistent phylogeny model is intermediate between the perfect and the persistent phylogeny, since a perfect phylogeny allows no back mutations and a persistent phylogeny allows each character to back mutate only once. We describe an algorithm to compute a species-driven persistent phylogeny and we prove that every matrix admitting a galled-tree also admits a species-driven persistent phylogeny.
Keywords: perfect phylogeny, persistent perfect phylogeny, galled-tree
DOI: 10.3233/FI-2017-1552
Journal: Fundamenta Informaticae, vol. 154, no. 1-4, pp. 47-63, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]