Unveiling Dynamics and Complexity

Character-based Phylogeny Construction is a well-known combinatorial problem whose input is a matrix M and we want to compute a phylogeny that is compatible with the actual species encoded by M . In this paper we survey some of the known formulations and algorithms for some variants of this problem. Finally, we present the connections between these problems and tumor evolution, and we discuss some of the most important open problems.

[1]  Matthias Schröder,et al.  Extended admissibility , 2002, Theor. Comput. Sci..

[2]  Paolo Ferragina,et al.  Indexing compressed text , 2005, JACM.

[3]  Gonzalo Navarro,et al.  Succinct Suffix Arrays based on Run-Length Encoding , 2005, Nord. J. Comput..

[4]  Esko Ukkonen,et al.  Lempel-Ziv parsing and sublinear-size index structures for string matching , 1996 .

[5]  Yann Pequignot,et al.  A Wadge hierarchy for second countable spaces , 2015, Arch. Math. Log..

[6]  Gonzalo Navarro,et al.  Self-Index Based on LZ77 , 2011, ArXiv.

[7]  Juha Kärkkäinen,et al.  LZ77-Based Self-indexing with Faster Pattern Matching , 2014, LATIN.

[8]  Victor L. Selivanov,et al.  Some Hierarchies of QCB0-Spaces , 2013, ArXiv.

[9]  Daniel Valenzuela,et al.  CHICO: A Compressed Hybrid Index for Repetitive Collections , 2016, SEA.

[10]  David Haussler,et al.  Complete inverted files for efficient text retrieval and analysis , 1987, JACM.

[11]  Arno Pauly,et al.  Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces , 2013, ArXiv.

[12]  Arno Pauly,et al.  The descriptive theory of represented spaces , 2014, ArXiv.

[13]  K. Weihrauch.  The TTE-Interpretation of Three Hierarchies of Omniscience Principles , 1992 .

[14]  Benedikt Löwe,et al.  GAME CHARACTERIZATIONS AND LOWER CONES IN THE WEIHRAUCH DEGREES , 2019 .

[15]  Arno Pauly,et al.  Relative computability and uniform continuity of relations , 2011, J. Log. Anal..

[16]  Maxime Crochemore,et al.  Automata for Matching Patterns , 1997, Handbook of Formal Languages.

[17]  K. Weihrauch.  The Degrees of Discontinuity of some Translators Between Representations of the Real Numbers , 1992 .

[18]  Dan Gusfield.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[19]  Mathieu Raffinot,et al.  Composite Repetition-Aware Data Structures , 2015, CPM.

[20]  Arno Pauly,et al.  On the topological aspects of the theory of represented spaces , 2012, Comput..

[21]  Djamal Belazzougui,et al.  Linear time construction of compressed text indices in compact space , 2014, STOC.

[22]  Alistair Moffat,et al.  From Theory to Practice: Plug and Play with Succinct Data Structures , 2013, SEA.

[23]  Arno Pauly.  Computable metamathematics and its application to game theory , 2012 .

[24]  Mathieu Raffinot.  On maximal repeats in strings , 2001, Inf. Process. Lett..

[25]  J. Ian Munro,et al.  Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[26]  Maxime Crochemore,et al.  Direct Construction of Compact Directed Acyclic Word Graphs , 1997, CPM.

[27]  Timothy M. Chan,et al.  Orthogonal range searching on the RAM, revisited , 2011, SoCG '11.

[28]  Gonzalo Navarro,et al.  On compressing and indexing repetitive sequences , 2013, Theor. Comput. Sci..

[29]  Peter Elias,et al.  The Complexity of Some Simple Retrieval Problems , 1975, JACM.

[30]  Donald R. Morrison,et al.  PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[31]  Victor L. Selivanov,et al.  Hyperprojective hierarchy of qcb0-spaces , 2014, De Computis.

[32]  Klaus Weihrauch,et al.  Computable Analysis , 2005, CiE.

[33]  Arno Pauly,et al.  Many-one reductions and the category of multivalued functions , 2015, Mathematical Structures in Computer Science.

[34]  Gonzalo Navarro,et al.  Stronger Lempel-Ziv Based Compressed Text Indexing , 2012, Algorithmica.

[35]  Igor Walukiewicz,et al.  Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus , 2000, Inf. Comput..

[36]  B. T. Semmes,et al.  A game for the Borel functions , 2009 .

[37]  Arno Pauly,et al.  Descriptive Set Theory in the Category of Represented Spaces , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[38]  Dan E. Willard,et al.  Log-logarithmic worst-case range queries are possible in space ⊕(N) , 1983 .

[39]  William W. Wadge,et al.  Reducibility and Determinateness on the Baire Space , 1982 .

[40]  Gonzalo Navarro,et al.  Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections , 2008, SPIRE.

[41]  Gonzalo Navarro,et al.  Storage and Retrieval of Highly Repetitive Sequence Collections , 2010, J. Comput. Biol..