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
Preserved Fulltext
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. ...
doi:10.1016/0097-3165(74)90050-8
fatcat:v4gjgfq53jbg7l2m45ru3dmkha
Generalised distances of sequences II: B-distances with weight sequences
2019
Filomat
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
By assigning various weights to 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. ...
doi:10.2298/fil1918803n
fatcat:v3dewjzdd5gyjm2fwlgdyuyrbq
Generalised distances of sequences I: $B$-distances
2018
Miskolc Mathematical Notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We extend their application to 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. ...
doi:10.18514/mmn.2018.2058
fatcat:6xpwj5b2irg3lims7xxzawhuh4
Pattern recognition in genetic sequences
1979
Proceedings of the National Academy of Sciences of the United States of America
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper announces 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. ...
doi:10.1073/pnas.76.7.3041
pmid:16592667
pmcid:PMC383757
fatcat:hg6rfqljkbbenkcnxbyudcf77u
A Comparative Study on String Matching Algorithm of Biological Sequences
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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 ...
arXiv:1401.7416v1
fatcat:pkl42vs7rzesxaudqvdkfcf36e
Refolding Planar Polygons
2009
Discrete & Computational Geometry
Preserved Fulltext
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.
This paper describes 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. ...
doi:10.1007/s00454-009-9145-7
fatcat:kpy2alrzznambbaikws7j2zbxm
Refolding planar polygons
2006
Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06
Preserved Fulltext
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.
This paper describes 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. ...
doi:10.1145/1137856.1137869
dblp:conf/compgeom/IbenOD06
fatcat:lmes5sabjnhafeonmkezy4ahjm
Refolding planar polygons
2004
ACM SIGGRAPH 2004 Sketches on - SIGGRAPH '04
Preserved Fulltext
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.
This paper describes 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. ...
doi:10.1145/1186223.1186341
dblp:conf/siggraph/IbenOD04
fatcat:66hzj54ljbchfm3las2zkjqhye
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
Preserved Fulltext
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.
This paper proposes 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. ...
doi:10.1109/cisp.2012.6470029
fatcat:66in4wfpcbhm3jbtl2drmrv4q4
Behavioral Learning of Aircraft Landing Sequencing Using a Society of Probabilistic Finite State Machines
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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. ...
arXiv:1802.10203v1
fatcat:qssipmlt4zfxhk7wplhntkvomm
Approximation Metrics for Discrete and Continuous Systems
2007
IEEE Transactions on Automatic Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
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 ...
doi:10.1109/tac.2007.895849
fatcat:fcum22qszncqbagly4icwmcxru
Learning from Uncertain Data
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
kernels, and describe a general 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. ...
doi:10.1007/978-3-540-45167-9_48
fatcat:q3sqeiremzcgdiozz5sovakdjq
Page 4201 of Mathematical Reviews Vol. , Issue 2001F
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
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
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
This paper presents linear-space 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. ...
arXiv:0904.4686v1
fatcat:6eyuklpi2bbgxamquf4d625emy
Top-Down Tree Edit-Distance of Regular Tree Languages
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.1007/978-3-319-04921-2_38
fatcat:v4mjbnxzmnbv7afqi6qtdpum3a
« Previous
Showing results 1 — 15 out of 243,797 results