Using a distance matrix as input, the qsearch library finds a tree that fits the input data as well as possible and returns this tree along with a confidence score for any non-degenerate distance matrix.