fraunhoferportugal / tssearch Star 48 Code Issues Pull requests A Python library for time series subsequence search. elasticsearch data-science time-series segmentation subsequence-matching distances subsequence-dynamic-time-warping Updated Jun 10, 2024 Python
Junior-Weil / Longest-Common-Subsequence Star 0 Code Issues Pull requests Longest Common Subsequence algorithm. Global Alignment is the Needleman Wunsche algorithm and the local alignment is Smith Waterman algorithm smith-waterman needleman-wunsch backtracking dynamic-programming backtracking-algorithm subsequence-matching needleman-wunsch-algorithm smith-waterman-algorithm Updated Nov 22, 2023 Python