A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
An algorithm for the distance between two finite sequences

1974
*
Journal of combinatorial theory. Series A
*

*THE*

*ALGORITHM*In a biological problem, which will be described later, it is necessary to compute

*the*

*distance*or degree of dissimilarity

*between*

*two*

*finite*

*sequences*. ... A mathematical definition of this

*distance*was brought to my attention by S. M. Ulam, and

*an*

*algorithm*

*for*computing it will be presented here. ...

*THE*

*ALGORITHM*In a biological problem, which will be described later, it is necessary to compute

*the*

*distance*or degree of dissimilarity

*between*

*two*

*finite*

*sequences*. ...

##
###
Generalised distances of sequences II: B-distances with weight sequences

2019
*
Filomat
*

By assigning various weights to

doi:10.2298/fil1918803n
fatcat:v3dewjzdd5gyjm2fwlgdyuyrbq
*the*elements of*the**sequences**the*concept is further generalized.*An**algorithm*is presented which provides a shortest path*between**two**sequences*. ...*The*general neighbourhood*sequences*were introduced*for*measuring*distances*in digital geometry (Z n ), and*the*theory was recently extended*for*application to*sequences*. ... Acknowledgement*The*author is grateful to Zs. Páles, Z. Boros and A. Gilányi and*the*anonymous reviewer*for*their valuable remarks. ...##
###
Generalised distances of sequences I: $B$-distances

2018
*
Miskolc Mathematical Notes
*

We extend their application to

doi:10.18514/mmn.2018.2058
fatcat:6xpwj5b2irg3lims7xxzawhuh4
*sequences*, and present*an**algorithm*which provides a shortest path*between**two**sequences*. ... We also present a formula to calculate*the*B-*distance*of any*two**sequences**for*a neighbourhood*sequence*B. ... In*the*third section, we present*an**algorithm*to solve*the*shortest path problem*between*any*two**sequences*. In section four, we describe some properties of B-*distances*. ...##
###
Pattern recognition in genetic sequences

1979
*
Proceedings of the National Academy of Sciences of the United States of America
*

This paper announces

doi:10.1073/pnas.76.7.3041
pmid:16592667
pmcid:PMC383757
fatcat:hg6rfqljkbbenkcnxbyudcf77u
*an**algorithm**for*finding pattern similarities*between**two*given*finite**sequences*. ...*Two*portions, one from each*sequence*, are similar if they are close in*the*metric space of evolutionary*distances*. ... Recognition of a given pattern There is a known dynamic programming*algorithm*(ref. 1)*for*computing*the*evolutionary*distance**between**two**finite**sequences*. ...##
###
A Comparative Study on String Matching Algorithm of Biological Sequences
[article]

2014
*
arXiv
*
pre-print

*For*this study, we have assessed

*the*performance of

*algorithms*tested with biological

*sequences*. ...

*For*that,

*the*researcher is supposed to aware of similarities on

*the*biological

*sequences*. ...

*The*

*distance*itself gives

*the*number of mismatches

*between*

*the*variables paired by k.

*the*

*distance*is applied to

*the*biological

*sequences*

*for*finding minimum no of substitutions

*for*changing one

*sequence*...

##
###
Refolding Planar Polygons

2009
*
Discrete & Computational Geometry
*

This paper describes

doi:10.1007/s00454-009-9145-7
fatcat:kpy2alrzznambbaikws7j2zbxm
*an**algorithm**for*generating a guaranteed intersectionfree interpolation*sequence**between*any pair of compatible polygons. ...*The*computational machinery that ensures against self-intersection is independent from a*distance*metric that determines*the*overall character of*the*interpolation*sequence*. ... Okawa Foundation, and*the*Alfred P. ...##
###
Refolding planar polygons

2006
*
Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06
*

This paper describes

doi:10.1145/1137856.1137869
dblp:conf/compgeom/IbenOD06
fatcat:lmes5sabjnhafeonmkezy4ahjm
*an**algorithm**for*generating a guaranteed intersectionfree interpolation*sequence**between*any pair of compatible polygons. ...*The*computational machinery that ensures against self-intersection is independent from a*distance*metric that determines*the*overall character of*the*interpolation*sequence*. ... Okawa Foundation, and*the*Alfred P. ...##
###
Refolding planar polygons

2004
*
ACM SIGGRAPH 2004 Sketches on - SIGGRAPH '04
*

This paper describes

doi:10.1145/1186223.1186341
dblp:conf/siggraph/IbenOD04
fatcat:66hzj54ljbchfm3las2zkjqhye
*an**algorithm**for*generating a guaranteed intersectionfree interpolation*sequence**between*any pair of compatible polygons. ...*The*computational machinery that ensures against self-intersection is independent from a*distance*metric that determines*the*overall character of*the*interpolation*sequence*. ... Okawa Foundation, and*the*Alfred P. ...##
###
Tracking orthogonal vanishing points in video sequences for a reliable camera orientation in Manhattan World

2012
*
2012 5th International Congress on Image and Signal Processing
*

This paper proposes

doi:10.1109/cisp.2012.6470029
fatcat:66in4wfpcbhm3jbtl2drmrv4q4
*an**algorithm*pipeline*for*estimating*the*camera orientation based on vanishing points computation targeting pedestrian navigation assistance in Manhattan World. ... Experiments on real images and video*sequences*show that*the*proposed heuristic strategy*for*selecting orthogonal vanishing points is pertinent as our*algorithm*gives better results than*the*recently published ... ACKNOWLEDGMENT This study is supported by HERON Technologies SAS and*the*Conseil Général du LOIRET. ...##
###
Behavioral Learning of Aircraft Landing Sequencing Using a Society of Probabilistic Finite State Machines
[article]

2018
*
arXiv
*
pre-print

*The*approach relies on a genetic

*algorithm*(GA) to learn these

*sequences*using a society Probabilistic

*Finite*-state Machines (PFSMs). ... Three

*sequence*metrics (Levenshtein, Hamming and Position

*distances*) are compared as

*the*fitness functions in GA. ... ACKNOWLEDGEMENT This work has been funded by

*the*Australian Research Council (ARC) discovery grant number, DP140102590: Challenging systems to discover vulnerabilities using computational red teaming. ...

##
###
Approximation Metrics for Discrete and Continuous Systems

2007
*
IEEE Transactions on Automatic Control
*

*distance*

*between*

*the*systems. ... We define a hierarchy of approximation pseudo-metrics

*between*

*two*systems that quantify

*the*quality of

*the*approximation, and capture

*the*established exact relationships as zero sections. ...

*For*any external trajectory of

*the*system , we can find

*an*external trajectory of

*the*system , with

*the*same

*sequence*of labels, such that

*the*

*distance*

*between*

*the*observations of

*the*

*two*systems remains ...

##
###
Learning from Uncertain Data
[chapter]

2003
*
Lecture Notes in Computer Science
*

kernels, and describe a general

doi:10.1007/978-3-540-45167-9_48
fatcat:q3sqeiremzcgdiozz5sovakdjq
*algorithm**for*computing them efficiently. ...*The*application of statistical methods to natural language processing has been remarkably successful over*the*past*two*decades. ...*between**two*languages,*the*sets of*sequences*accepted by*two*automata and provide*an*efficient*algorithm**for*its computation. ...##
###
Page 4201 of Mathematical Reviews Vol. , Issue 2001F
[page]

2001
*
Mathematical Reviews
*

*for*functions and relations, (4) finding

*sequences*

*for*automata identification or testing (such as homing

*sequences*, synchronizing

*sequences*, etc.), (5) conversions

*between*different representations ( ... We give a sequential

*algorithm*

*for*this problem, and show how to obtain

*an*NC

*algorithm*running in O(log) time using ...

##
###
Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton
[article]

2009
*
arXiv
*
pre-print

This paper presents linear-space

arXiv:0904.4686v1
fatcat:6eyuklpi2bbgxamquf4d625emy
*algorithms**for*computing*the*edit-*distance**between*a string and*an*arbitrary weighted automaton over*the*tropical semiring, or*an*unambiguous weighted automaton over*an*...*The*problem of computing*the*edit-*distance**between*a string and a*finite*automaton arises in a variety of applications in computational biology, text processing, and speech recognition. ... We presented general*algorithms**for*computing in linear space both*the*editdistance*between*a string and a*finite*automaton and their optimal alignment. ...##
###
Top-Down Tree Edit-Distance of Regular Tree Languages
[chapter]

2014
*
Lecture Notes in Computer Science
*

*The*edit-

*distance*is a metric

*for*measuring

*the*similarity or dissimilarity

*between*

*two*objects, and a regular tree language is a set of trees accepted by a

*finite*-state tree automaton or described by ... We also suggest how to use

*the*edit-

*distance*

*between*

*two*tree languages

*for*identifying a special common string

*between*

*two*context-free grammars. ...

*For*

*the*edit-

*distance*

*between*

*two*unranked TAs of sizes m and n, we have designed

*an*O(m 2 n 2 log mn)

*algorithm*. ...

« Previous

*Showing results 1 — 15 out of 243,797 results*