Back to search

Article

Longest Order Conserved Exemplar Subsequences

2020-12-15

Abstract excerpt

We propose a new problem whose input data are two linear genomes together with two indexed gene subsequences of them, which asks to find a longest common exemplar subsequence of the two given genomes with a subsequence identical to the given indexed gene subsequences. We present an algorithm for this problem such that the algorithm is allowed to take diminishing time and space to solve the problem by setting the i...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work
5eff1e2d-c825-5ff4-8f7c-f5b5571cae82
DOI
10.1101/2020.12.15.422841
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
Longest Order Conserved Exemplar SubsequencesDOI 10.1101/2020.12.15.422841
A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance.Semantic proximity
The zero exemplar distance problem.Semantic proximity
The mutated subsequence problem and locating conserved genes.Semantic proximity
A Spectral Rotation Method with Triplet Periodicity Property for Planted Motif Finding Problems.Semantic proximity
STAR: an algorithm to Search for Tandem Approximate Repeats.Semantic proximity
Efficient computation of approximate gene clusters based on reference occurrences.Semantic proximity
A graph-theoretical approach to DNA similarity analysisSemantic proximity
The infinite sites model of genome evolution.Semantic proximity
Application of consensus string matching in the diagnosis of allelic heterogeneity involving transposition mutation.Semantic proximity
Hyperbolic Rules of the Oligomer Cooperative Organization of Eukaryotic and Prokaryotic GenomesSemantic proximity
An Algorithm for Motif Discovery with Iteration on Lengths of Motifs.Semantic proximity
An efficient algorithm for identifying matches with errors in multiple long molecular sequences.Semantic proximity
Select a neighboring publication to make it the new centre.