39 citations · 47 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2005
A linear-time algorithm for finding the longest segment which scores above a given threshold
Miklós Csűrös
This paper describes a linear-time algorithm that finds the longest stretch in a sequence of real numbers (``scores'') in which the sum exceeds an input parameter. The algorithm al…
cs.DS2000
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets
Miklos Csuros, Ming-Yang Kao
We give a greedy learning algorithm for reconstructing an evolutionary tree based on a certain harmonic average on triplets of terminal taxa. After the pairwise distances between t…