Add to ORKGDescription: Given two sequences x and y, CSC finds the cyclic rotation of x (or an approximation of it) that minimises the blockwise q-gram distance from y. Installation: To compile CSC, please follow the instructions given in file INSTALL. Citation: Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani: Circular Sequence Comparison with q-grams. WABI 2015: 203-216. License: GNU GPLv3 License; Copyright (C) 2015 Solon P. Pissis, Ahmad Retha and Fatima Vayani
A code X is (≥ k)-circular if any concatenation of at most k words from X, when read on a circle, ad...
The chain-code representation of contours is widely used in syntactic shape recognition. However the...
MotivationCircular permutation is an important type of protein rearrangement. Natural circular permu...
Description: Given two sequences x and y, CSC finds the cyclic rotation of x (or an approximation of...
International audienceSequence comparison is a fundamental step in many important tasks in bioinform...
Background: Sequence comparison is a fundamental step in many important tasks in bioinformatics; fro...
Background: Sequence comparison is a fundamental step in many important tasks in bioinformatics; fro...
Every position i in a given circular string A of length n gives rise to a linear string A[i],...,A[n...
Abstract. In this study, we propose a new dynamic warping algorithm for cy-clic sequence comparison,...
The analysis of small circular sequences requires specialized tools. While the differences between l...
Background: Circular string matching is a problem which naturally arises in many biological contexts...
A code X is k-circular if any concatenation of at most k words from X, when read on a circle, admits...
Abstract. We describe an algorithm that improves on the standard algorithm for computing the minimal...
We consider the problem of finding the optimal alignment and consensus (string) of circular strings....
This paper deals with the circular pattern matching (CPM) problem, which appears as an interesting p...
A code X is (≥ k)-circular if any concatenation of at most k words from X, when read on a circle, ad...
The chain-code representation of contours is widely used in syntactic shape recognition. However the...
MotivationCircular permutation is an important type of protein rearrangement. Natural circular permu...
Description: Given two sequences x and y, CSC finds the cyclic rotation of x (or an approximation of...
International audienceSequence comparison is a fundamental step in many important tasks in bioinform...
Background: Sequence comparison is a fundamental step in many important tasks in bioinformatics; fro...
Background: Sequence comparison is a fundamental step in many important tasks in bioinformatics; fro...
Every position i in a given circular string A of length n gives rise to a linear string A[i],...,A[n...
Abstract. In this study, we propose a new dynamic warping algorithm for cy-clic sequence comparison,...
The analysis of small circular sequences requires specialized tools. While the differences between l...
Background: Circular string matching is a problem which naturally arises in many biological contexts...
A code X is k-circular if any concatenation of at most k words from X, when read on a circle, admits...
Abstract. We describe an algorithm that improves on the standard algorithm for computing the minimal...
We consider the problem of finding the optimal alignment and consensus (string) of circular strings....
This paper deals with the circular pattern matching (CPM) problem, which appears as an interesting p...
A code X is (≥ k)-circular if any concatenation of at most k words from X, when read on a circle, ad...
The chain-code representation of contours is widely used in syntactic shape recognition. However the...
MotivationCircular permutation is an important type of protein rearrangement. Natural circular permu...
_-_Philippe_Binant_Archives.jpg%3Fwidth%3D300&w=3840&q=75)
