The reconciliation of a gene tree and a species tree is a well-known method to understand the evolution of a gene family in order to identify which evolutionary events (speciations, duplications and losses) occurred during gene evolution. Since reconciliation is usually affected by errors in the gene trees, they have to be preprocessed before the reconciliation process. A method to tackle with this problem aims to correct a gene tree by removing the minimum number of leaves (Minimum Leaf Removal). In this paper we show that Minimum Leaf Removal is not approximable within factor b logm, where m is the number of leaves of the species tree and b > 0 is a constant. Furthermore, we introduce a new variant of the problem, where the goal is the correction of a gene tree with the minimum number of leaf modifications. We show that this problem, differently from the removal version, is W[1]-hard, when parameterized by the number of leaf modifications. © 2014 Springer International Publishing.

Beretta, S., Dondi, R. (2014). Gene tree correction by leaf removal and modification: Tractability and approximability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp.42-52). Springer Verlag [10.1007/978-3-319-08019-2_5].

Gene tree correction by leaf removal and modification: Tractability and approximability

BERETTA, STEFANO
Primo
;
2014

Abstract

The reconciliation of a gene tree and a species tree is a well-known method to understand the evolution of a gene family in order to identify which evolutionary events (speciations, duplications and losses) occurred during gene evolution. Since reconciliation is usually affected by errors in the gene trees, they have to be preprocessed before the reconciliation process. A method to tackle with this problem aims to correct a gene tree by removing the minimum number of leaves (Minimum Leaf Removal). In this paper we show that Minimum Leaf Removal is not approximable within factor b logm, where m is the number of leaves of the species tree and b > 0 is a constant. Furthermore, we introduce a new variant of the problem, where the goal is the correction of a gene tree with the minimum number of leaf modifications. We show that this problem, differently from the removal version, is W[1]-hard, when parameterized by the number of leaf modifications. © 2014 Springer International Publishing.
paper
Computer Science (all); Theoretical Computer Science
English
10th Conference on Computability in Europe, CiE 2014
2014
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9783319080185
2014
8493
42
52
none
Beretta, S., Dondi, R. (2014). Gene tree correction by leaf removal and modification: Tractability and approximability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp.42-52). Springer Verlag [10.1007/978-3-319-08019-2_5].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/59898
Citazioni
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
Social impact