Paul Medvedev
@pashadag.bsky.social
Algorithmic Bioinformatics Researcher and Teacher. Posts about research results and educational/mentorship topics (for details, see http://bit.ly/380vX22).
If we create a plot mapping the sorted k-mers of a list to their location in the sorted list, we get a roughly linear plot like this. The PLA-complexity is then the number of segments necessary to fit this plot with a piece-wise linear curve with an error bounded by some parameter epsilon.
(2/n)
(2/n)
February 13, 2024 at 7:48 AM
If we create a plot mapping the sorted k-mers of a list to their location in the sorted list, we get a roughly linear plot like this. The PLA-complexity is then the number of segments necessary to fit this plot with a piece-wise linear curve with an error bounded by some parameter epsilon.
(2/n)
(2/n)