The Closest Substring Problem With Small Distances

doi 10.1109/sfcs.2005.70
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

Time-Space Trade-Offs for the Longest Common Substring Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

An Optimal Algorithm for the On-Line Closest-Pair Problem

1992English

On the Aleksandrov Problem of Conservative Distances

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1992English

Colored Range Closest-Pair Problem Under General Distance Functions

2019English

Problem of the Estimate of Distances to Pulsars

Australian Journal of Physics
1987English

Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

Journal of Computer Science and Technology
HardwareComputer Science ApplicationsArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2012English

Test of CPT at Very Small Distances.

1972English

The Average Common Substring Approach to Phylogenomic Reconstruction

Journal of Computational Biology
GeneticsMolecular BiologyComputational TheorySimulationComputational MathematicsMathematicsModeling
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy