search

amnh / PCG

𝙋𝙝𝙮𝙡𝙤𝙜𝙚𝙣𝙚𝙩𝙞𝙘 𝘾𝙤𝙢𝙥𝙤𝙣𝙚𝙣𝙩 𝙂𝙧𝙖𝙥𝙝 ⸺ Haskell program and libraries for general phylogenetic graph search
28 stars 1 forks source link

Publish sequential alignment heuristic for dynamic characters #34

Closed recursion-ninja closed 4 years ago

recursion-ninja commented 7 years ago

Work with Yu Xiang to do all of the following. He's included in the "royal we" used below.

We'll need to define the inter-workings of the sequential alignment algorithm. Next determine the asymtotic complexity of the algorithm on dynamic characters of varying alphabet size. After providing a formal description and analysis, we should perform empirical tests on dynamic characters of increasing length defined over varying alphabet size. The hypothesis is that the sequential alignment algorithm will run in near linear time with increasing efficacy as the dynamic characters increase in length.

recursion-ninja commented 4 years ago

Closing as Sequential Align has been removed from the project.