We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
Pierre Peterlongo, Julien Allali, Marie-France Sag...
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
Michael Dorfling, Wayne Goddard, Michael A. Hennin...
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...