Before revision:  We give a linear time algorithm and a parameterized near linear time algorithm to construct a repeat-free founder graph and a repeat-free elastic founder graph, respectively. We derive a tailored succinct index structure to support queries of arbitrary length in the paths of a repeat-free (elastic) founder graph. In addition , we show how to turn a repeat-free (elastic ) founder graph into a Wheeler graph in polynomial time .
After revision:  We give a linear time algorithm and a parameterized near linear time algorithm to construct a repeat-free founder graph and a repeat-free , respectively) elastic founder graphs from general MSAs. Finally , we show how to turn a repeat-free (elastic ) founder graph into a Wheeler graph in polynomial time .