Approximation to the mean curve in the LCS problem

Approximation to the mean curve in the LCS problem

Mostra altre versioni (1)

The problem of sequence comparison via optimal alignments occurs naturally in many areas of applications. The simplest such technique is based on evaluating a score given by the length of a longest common subsequence divided by the average length of the original sequences. In this paper we investiga...

Descrizione completa

Dettagli Bibliografici
Autori principali:	Durringer, C, Hauser, R, Matzinger, H
Natura:	Report
Pubblicazione:	Unspecified 2006

Documenti analoghi

Approximation to the mean curve in the LCS problem
di: Durringer, C, et al.
Pubblicazione: (2008)

Upper bounds on the mean curve in the LCS problem
di: Durringer, C, et al.
Pubblicazione: (2008)

Large deviation based upper bounds for the LCS-problem
di: Hauser, R, et al.
Pubblicazione: (2003)

Application of the LCS Problem to High Frequency Financial Data
di: Ngan, K
Pubblicazione: (2013)

Cognitive Task Analysis for the LCS Operator
di: Scott, S. D., et al.
Pubblicazione: (2009)

Freedom arrives : what next for the LCS?
di: Graham, Euan
Pubblicazione: (2014)

Strict compliance of documents in Letters of Credit (LCs) transaction: A new dimension
di: Che Hashim, R.
Pubblicazione: (2007)

A Monte Carlo Approach to the Fluctuation Problem in Optimal Alignments of Random Strings
di: Amsalu, S, et al.
Pubblicazione: (2012)

Approximating the epidemic curve
di: Barbour, A, et al.
Pubblicazione: (2013)

Enhancing GAN-LCS Performance Using an Abbreviations Checker in Automatic Short Answer Scoring
di: Muhammad, Ar-Razy, et al.
Pubblicazione: (2022)

A Monte Carlo approach to the fluctuation problem in optimal alignments of random strings
di: Amsalu, S, et al.
Pubblicazione: (2014)

A web usage mining approach based on LCS algorithm in online predicting recommendation systems
di: Jalali, Mehrdad, et al.
Pubblicazione: (2008)

Letter Change Bias and Local Uniqueness in Optimal Sequence Alignments
di: Hauser, R, et al.
Pubblicazione: (2013)

Distribution of Aligned Letter Pairs in Optimal Alignments of Random Sequences
di: Hauser, R, et al.
Pubblicazione: (2012)

Letter Change Bias and Local Uniqueness in Optimal Sequence Alignments
di: Hauser, R, et al.
Pubblicazione: (2013)

Local Uniqueness of Alignments with a Fixed Proportion of Gaps
di: Hauser, R, et al.
Pubblicazione: (2005)

Compact elements and smallest faithful representation of C*-algebras
di: Hauser, R, et al.
Pubblicazione: (1995)

Topologically reliable approximation of curves and surfaces
di: Cho, Wonjoon
Pubblicazione: (2009)

Microscopic path structure of optimally aligned random sequences
di: Hauser, RA, et al.
Pubblicazione: (2019)

Large deviations-based upper bounds on the expected relative length of longest common subsequences
di: Hauser, R, et al.
Pubblicazione: (2006)

Two Variational Techniques for the Approximation of Curves of Maximal Slope
di: Ortner, C
Pubblicazione: (2005)

Approximating Generalised Cornu Spiral With Low Energy Curve
di: Chan , Chiu Ling
Pubblicazione: (2012)

Circular Arc Approximation by Quartic H-Bézier Curve
di: Hussain, Maria, et al.
Pubblicazione: (2017)

Circular Arc Approximation by Quartic H-Bézier Curve
di: Hussain, Maria, et al.
Pubblicazione: (2017)

PCA by determinant optimisation has no spurious local optima
di: Hauser, R, et al.
Pubblicazione: (2018)

An upper bound on the convergence rate of a second functional in optimal sequence alignment
di: Hauser, R, et al.
Pubblicazione: (2017)

Mean-field approximations and multipartite thermal correlations
di: Vedral, V
Pubblicazione: (2004)

Analytic approximations for transit light curve observables, uncertainties, and covariances
di: Carter, Joshua Adam, et al.
Pubblicazione: (2010)

Time-domain synthesis by means of trigonometric polynomial approximations
Pubblicazione: (2004)

Approximate k-means clustering through random projections
di: Persu, Elena-Mădălina
Pubblicazione: (2015)

Correcting mean-field approximations for birth-death-movement processes
di: Baker, R, et al.
Pubblicazione: (2011)

Correcting mean-field approximations for birth-death-movement processes.
di: Baker, R, et al.
Pubblicazione: (2010)

SwinUNeLCsT: Global–local spatial representation learning with hybrid CNN–transformer for efficient tuberculosis lung cavity weakly supervised semantic segmentation
di: Zhuoyi, Tan, et al.
Pubblicazione: (2024)

Mean-field approximation for networks with synchrony-driven adaptive coupling
di: Fennelly, N, et al.
Pubblicazione: (2025)

Quantifying the estimation error of principal component vectors
di: Hauser, R, et al.
Pubblicazione: (2019)

Feature Point Detection and Curve Approximation for Early Processing of Freehand Sketches
di: Sezgin, Tevfik Metin
Pubblicazione: (2004)

Accurate and efficient approximation of clothoids using Bézier curves for path planning
di: Chen, Yong, et al.
Pubblicazione: (2020)

Approximate solutions of the Poincaré problem,
di: Gero, Istvan
Pubblicazione: (2005)

Approximation algorithms for stochastic scheduling problems
di: Dean, Brian C. (Brian Christopher), 1975-
Pubblicazione: (2006)

Mean queue time approximation of tandem queues with finite buffer
di: Tan, Phyllinda Shu Ning.
Pubblicazione: (2013)