Delta technique and string-to-string correction

2006 ◽  
pp. 64-68 ◽  
Author(s):  
Wolfgang Obst
Keyword(s):  
String Correction

scholarly journals An improved algorithm for solving the banded cyclic string-to-string correction problem

1998 ◽  
Vol 201 (1-2) ◽  
pp. 275-279 ◽  
Author(s):  
Chung Kuo-Liang
Keyword(s):  
String Correction ◽  
Correction Problem ◽  
Improved Algorithm

scholarly journals String correction for baryon orbital excitations

2010 ◽  
Vol 68 (1-2) ◽  
pp. 159-164 ◽  
Author(s):  
O. N. Driga ◽  
I. M. Narodetskii ◽  
A. I. Veselov
Keyword(s):  
String Correction

scholarly journals Infinity in string cosmology: A review through open problems

2017 ◽  
Vol 26 (04) ◽  
pp. 1730009 ◽  
Author(s):  
Ignatios Antoniadis ◽  
Spiros Cotsakis
Keyword(s):  
Higher Order ◽  
String Cosmology ◽  
Tree Level ◽  
Open Problems ◽  
String Correction ◽  
Recent Developments ◽  
M Theory

We review recent developments in the field of string cosmology with particular emphasis on open problems having to do mainly with geometric asymptotics and singularities. We discuss outstanding issues in a variety of currently popular themes, such as tree-level string cosmology asymptotics, higher-order string correction effects, M-theory cosmology, braneworlds and finally ambient cosmology.

COSMOLOGICAL PERTURBATIONS IN GENERALIZED GRAVITY THEORIES

2004 ◽  
Vol 19 (13n16) ◽  
pp. 1203-1206 ◽  
Author(s):  
HYERIM NOH ◽  
JAI-CHAN HWANG
Keyword(s):  
Perturbation Theory ◽  
Cosmological Perturbations ◽  
Cosmological Perturbation ◽  
Cosmological Perturbation Theory ◽  
String Correction ◽  
Gravity Theories ◽  
Correction Terms ◽  
Classical Evolution

We present cosmological perturbation theory based on generalized gravity theories including string correction terms as well as a tachyonic complication. The classical evolution as well as the quantum generation processes in these variety of gravity theories are presented in unified forms. These apply both to the scalar- and tensor-type perturbations.

scholarly journals The string-to-string correction problem with block moves

1984 ◽  
Vol 2 (4) ◽  
pp. 309-321 ◽  
Author(s):  
Walter F. Tichy
Keyword(s):  
String Correction ◽  
Correction Problem

Fast string correction with Levenshtein automata

2002 ◽  
Vol 5 (1) ◽  
pp. 67-85 ◽  
Author(s):  
Klaus U. Schulz ◽  
Stoyan Mihov
Keyword(s):  
String Correction

FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES

2010 ◽  
Vol 20 (04) ◽  
pp. 449-469 ◽  
Author(s):  
DANNY Z. CHEN ◽  
EWA MISIOŁEK
Keyword(s):  
Directed Graphs ◽  
Optimal Path ◽  
Single Source ◽  
Surface Band ◽  
Closed Curves ◽  
Optimal Paths ◽  
Time Space ◽  
String Correction ◽  
Programming Algorithms ◽  
Single Path

Many algorithms for applications such as pattern recognition, computer vision, and computer graphics seek to compute actual optimal paths in weighted directed graphs. The standard approach for reporting an actual optimal path is based on building a single-source optimal path tree. A technique by Chen et al.2 was given for a class of problems such that a single actual optimal path can be reported without maintaining any single-source optimal path tree, thus significantly reducing the space bound of those problems with no or little increase in their running time. In this paper, we extend the technique by Chen et al.2 to the generalized problem of reporting many actual optimal paths with different starting and ending vertices in certain directed graphs, and show how this new technique yields improved results on several application problems, such as reconstructing a 3-D surface band bounded by two simple closed curves, finding various constrained segmentation of 2-D medical images, and circular string-to-string correction. We also correct an error in the time/space complexity for the well-cited circular string-to-string correction algorithm12 and give an improved result for this problem. Although the generalized many-path problem seems more difficult than the single-path cases, our algorithms have nearly the same space and time bounds as those of the single-path cases. Our technique is likely to help improve many other optimal paths or dynamic programming algorithms.

On a cyclic string-to-string correction problem

1990 ◽  
Vol 35 (2) ◽  
pp. 73-78 ◽  
Author(s):  
Maurice Maes
Keyword(s):  
String Correction ◽  
Correction Problem
Sign in / Sign up

Export Citation Format

Share Document