Solr API,Twitter4j
-
Updated
Mar 19, 2017 - Java
Solr API,Twitter4j
Dynamic Programming
Contains Plagarism checking, implemented with the concept of Longest common subsequence.
This is a project that shows how to find the longest common substring in an array of strings.
A simple telephone directory using splay trees
This repository contains some well-known programming problems and their greedy/recusrive as well as dynamic algorithms.
Fuzzy search using Levenshtein Distance (LD) and Longest Common Substring (LCS) algorithm.
C codes for standard algorithms
To find the Longest Common Subsequence(LCS) of two Strings
COT6405 Analysis of algorithms Spring 2020
This repository contains python script for calculating Longest Common Subsequences (LSC) between tokenized URDU sentences.
Algorithms based on dynamic programming
Solutions to the problems in "Dynamic Programming I", part of the Dynamic Programming Study Plan on LeetCode.
Projet d'algorithmique sur structure de données
Learned as a part of Algorithm Design Course
code from exercises in module I832 Algorithms of HTW Dresden
LCS probelm
Add a description, image, and links to the longest-common-subsequence topic page so that developers can more easily learn about it.
To associate your repository with the longest-common-subsequence topic, visit your repo's landing page and select "manage topics."