[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.

This repo consists codes of Aditya Verma - Dynamic Programming Playlist

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

//contains recursion programs for practice and learning

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…

Convert an array to an object supporting fancy indexing.

The minimal elements of the prime numbers which are > b written in the positional numeral system with radix b, as digit strings under the subsequence ordering, for 2 ≤ b ≤ 36

"Number of Matching Subsequences" LeetCode Problem Solution

Parse a string-serialized Slice object.

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

Compute the shape of a normalized multi-slice.

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

Convert an ndarray to an object supporting fancy indexing.

Normalize a Slice object.

Convert a multidimensional subsequence string to a MultiSlice object.

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

Dynamic Programming