lca
Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing (by ekmett)
edit-distance
Edit distance library for Haskell (by haskellari)
| lca | edit-distance | |
|---|---|---|
| 1 | - | |
| 24 | 20 | |
| - | - | |
| 0.0 | 0.0 | |
| about 2 years ago | about 3 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
lca
Posts with mentions or reviews of lca.
We have used some of these posts to build our list of alternatives
and similar projects.
-
Fastest common prefix algorithm?
And I found another reference: online lowest common ancestor search that is basically using the same tree structure as history trees.
edit-distance
Posts with mentions or reviews of edit-distance.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning edit-distance yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing lca and edit-distance you can also consider the following projects:
union-find - Efficient union and equivalence testing of sets.
edit-distance-vector - Calculate edit scripts and distances between Vectors.
ersatz - A monad for interfacing with external SAT solvers
dtw - Implementation of Dynamic Time Warping in Haskell
twentyseven - Rubik's cube solver in Haskell
graphs - a monadic graph library
sgd - Stochastic gradient descent Haskell library
adp-multi - Prototype of ADP for MCFL (multiple context-free languages)
primes - Prime Numbers for Haskell
spacefill - Space-filling curves
arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences