DeepAI AI Chat
Log In Sign Up

Cantor Mapping Technique

01/08/2021
by   Kaustubh Joshi, et al.
0

A new technique specific to String ordering utilizing a method called "Cantor Mapping" is explained in this paper and used to perform string comparative sort in loglinear time while utilizing linear extra space.

READ FULL TEXT

page 1

page 2

page 3

03/17/2020

A New Implementation of Manacher's Algorithm

Manacher's algorithm is optimal for the longest palindromic substring pr...
03/17/2020

An Efficient Implementation of Manacher's Algorithm

Manacher's algorithm has been shown to be optimal to the longest palindr...
06/15/2018

Enhanced string factoring from alphabet orderings

In this note we consider the concept of alphabet ordering in the context...
06/02/2021

Counting Lyndon Subsequences

Counting substrings/subsequences that preserve some property (e.g., pali...
06/24/2019

Dynamic Palindrome Detection

Lately, there is a growing interest in dynamic string matching problems....
08/11/2021

Practical evaluation of Lyndon factors via alphabet reordering

We evaluate the influence of different alphabet orderings on the Lyndon ...
09/23/2022

From String Detection to Orthogonal Vector Problem

Considering Grover's Search Algorithm (GSA) with the standard diffuser s...