[VLDB 2022] Dash application for "Navigating the Labyrinth of Time Series Anomaly Detection"

Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.

A Swift library for writing & manipulating patterns for matching on collections.

This repo consists codes of Aditya Verma - Dynamic Programming Playlist

The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from problems of finding common substrings: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The longest…

//contains recursion programs for practice and learning

Convert an array to an object supporting fancy indexing.

Parse a string-serialized Slice object.

"Number of Matching Subsequences" LeetCode Problem Solution

Normalize a MultiSlice object.

Create an iterator which replaces all values from a provided iterator from a start index to an end index with a static value.

Convert an ndarray to an object supporting fancy indexing.

Normalize a Slice object.

Create a MultiSlice object from a comma-separated list of string-serialized MultiSlice constructor arguments.

Return a list of reduced dimensions in an un-normalized multi-slice.

Compute the shape of a normalized multi-slice.

Return a list of non-reduced dimensions in an un-normalized multi-slice.

Convert a multidimensional subsequence string to a MultiSlice object.