1 citations · 1 across the 1 of their papers we have counts for
1 paper
Veronica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber
We solve the problem of finding interspersed maximal repeats using a suffix array construction. As it is well known, all the functionality of suffix trees can be handled by suffix…