-
Hello,
I found your paper very impressive and am currently running the GitHub code. After seeing that you reported performance using the open-source model Mistral-7B in the paper, I am trying to re…
-
[An O(ND) Difference Algorithm and Its Variations](An O%28ND%29 Difference Algorithm and Its Variations)
-
Diffing a large text, e.g., 27k of text, `diff_chars` seems to take a very long time, whereas `diff_lines` finishes instantly. Is there a way to speed up the `diff_chars`?
-
I recently noticed that text-compare seems to present a undesirable changeset if the following happen:
1. You have some repeated code block with common start (e.g. `` in a pom.xml or `@Test` in a …
-
Hello,
Thank you for providing such a great tool. It has been incredibly helpful in my research. However, I recently encountered an issue after downloading the latest version.
When performing an…
-
LCS algorithm used in the ResponseBecomesRequest analyzer considers field names. The LCS should be restricted in such a way that it only considers the values for each key. Therefore, something shoul…
-
Hi,
I have been testing your different LCS algorithms. I am facing an issue with your optimized version OptimizedMyersLcs.java under lcs-algorithms or MyersLcs.java under lcs module. I got an java.…
-
those data structures aren't continous under append right?
feels kinda weird to have LCS for it, since they are unordered (but iterable) and LCS algorithm kinda requires input with an order intrinsic…
-
Like LCS(Longest Common Subsequence) is a very important algorithm in DSA, LIS(Longest Increasing Subsequence) is similarly important. I will like to contribute the solidity code for LIS to this repo.…
-
given a set of phenotype profiles, find the profile in common...the graph intersection. :)
i believe this would use the compare owlsim call, and it would give you back the set of phenotypes in commo…