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.
Filters
Weighted Shortest Common Supersequence Problem Revisited
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
We revisit the Weighted Shortest Common Supersequence (WSCS) problem, introduced by Amir et al. [SPIRE 2011], that is, the SCS problem on weighted strings. ...
We also discover a fundamental difference between the WSCS problem and the Weighted Longest Common Subsequence (WLCS) problem, introduced by Amir et al. [JDA 2010]. ...
In this paper, we study the Weighted Shortest Common Supersequence problem (the WSCS problem, in short) introduced by Amir et al. ...
doi:10.1007/978-3-030-32686-9_16
fatcat:anarfr4jfrhbziwm6cmeijveue
Weighted Shortest Common Supersequence Problem Revisited
[article]
2019
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.
We revisit the Weighted Shortest Common Supersequence (WSCS) problem, introduced by Amir et al. [SPIRE 2011], that is, the SCS problem on weighted strings. ...
We also discover a fundamental difference between the WSCS problem and the Weighted Longest Common Subsequence (WLCS) problem, introduced by Amir et al. [JDA 2010]. ...
In this paper, we study the Weighted Shortest Common Supersequence problem (the WSCS problem, in short) introduced by Amir et al. ...
arXiv:1909.11433v1
fatcat:wazrrs4fvfaw7jgtd53bbhvnoe
From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions
[article]
2019
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.
Other Versions
In this work, in addition to revisiting the entropy minimization conjecture, we also address several related combinatorial problems. ...
From this, one obtains a posterior distribution on the channel input, corresponding to a set of candidate supersequences weighted by the number of times the received subsequence can be embedded in them ...
The problems of finding shortest common supersequences (SCS) and longest common subsequences (LCS) represent two well-known NPhard problems [11] - [13] that involve similar subproblems. ...
arXiv:1802.00703v2
fatcat:ffiexcvjijft3d4rera25kdq6q
A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics
[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.
We show how the analytic-combinatorial methods of Flajolet, Szpankowski and Vallée for dealing with the hidden pattern matching problem can be applied to resolve the case of fixed output length and n→∞ ...
The problems of finding shortest common supersequences (SCS) and longest common subsequences (LCS) represent two other well-known NP-hard problems [12] , [13] , [14] that involve subproblems similar ...
ESTIMATING ENTROPY USING HIDDEN WORD STATISTICS We now revisit the original entropy problem and provide an analysis in the asymptotic limit by considering the case of fixed output length m and n → ∞. ...
arXiv:1807.11609v1
fatcat:4pu6hzm3gjhbdp3cf6vlexj62q
From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography
[article]
2020
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.
Next, we revisit the notion of deniability in quantum key exchange (QKE). We introduce and formalize the notion of coercer-deniable QKE. ...
The problems of finding shortest common supersequences (SCS) and longest common subsequences (LCS) represent two well-known NP-hard problems [100, 101, 102] that involve subproblems similar to our work ...
i k j + i=1 k i +1 2 supersequences of weight 1. • case 1/1: for all i in [ ] we have m − + 2 supersequence of weight k i + 1 and one of weight k i + k i+1 + 1 with the convention that k +1 = 0. ...
arXiv:2003.11663v1
fatcat:7ul4q6mupjcyzfyspus6xwh2ai
Memetic Algorithms and Complete Techniques
[chapter]
2012
Studies in Computational Intelligence
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.
In [20] the hybrid algorithm was experimentally evaluated on the multidimensional 0-1 knapsack problem and on the shortest common supersequence problem, a NP-hard classical problem from the realm of ...
optimal recombination, 6 hill climbing, 12 shortest common supersequence problem, 9 tabu search, 6 travelling salesman problem, 5, 8 Fig. 1 . 1 : 11 Puchinger and Raidl's classification of exact-heuristic ...
doi:10.1007/978-3-642-23247-3_12
fatcat:srccif4xofdatidibygi2iohim
An ant-based algorithm for coloring graphs
2008
Discrete Applied Mathematics
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.
This paper presents an ant-based algorithm for the graph coloring problem. ...
Other problems that have been the focus of AS as well as ACO [13] work include the quadratic assignment, network routing, vehicle routing, frequency assignment, graph coloring, shortest common supersequence ...
TSP is the well-known problem of finding the smallest cost tour in an edge weighted complete graph. The tour must visit each vertex in the graph exactly once, starting and ending at the same vertex. ...
doi:10.1016/j.dam.2006.07.012
fatcat:hixtivrglnfqrcj5dvbkz7bkyi
Simultaneous Hierarchical Clustering for Cell Formation Problems with Production Information
2018
Mathematical Problems in Engineering
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.
This practice allows flexible incorporation of multiple production factors in the resolution of CF problems. ...
The purpose of this paper is to advance the similarity coefficient method to solve cell formation (CF) problems in two aspects. ...
This file contains the images of the matrix solutions for the problems presented in Section 6.2. (Supplementary Materials) ...
doi:10.1155/2018/2841325
fatcat:7be3juw24bgdphew3yvsjj3rgu
Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions
1997
Pattern Recognition
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.
The paper includes experimental results involving sub-dictionaries of the most common English words which demonstrate the superiority of our system over existing methods. ...
We study the problem of recognizing a string Y which is the noisy version of some unknown string X * chosen from a finite dictionary, H. ...
Indeed, the same trellis can be traversed using various set operators to yield the Set of the LCSs and the Set of the Shortest Common Supersequences [8] . ...
doi:10.1016/s0031-3203(96)00101-x
fatcat:ptgtaxjoube2xcw2yegumqt5ze
Page 1543 of Mathematical Reviews Vol. , Issue Index
[page]
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.
(English summary) 98f:68122
Danchev, Stefan S. see Brimkov, Valentin E., 98m:68114
Dantik, Viado Common subsequences and supersequences and their expected length (English summary) 98e:68100
Dannoura, Eisuke ...
(English summary) 98k:68081
Cooper, Colin (with Frieze, Alan; Mehihorn, Kurt; Priebe, Volker) Average-<case complexity of shortest-paths problems in the vertex-potential model. ...
An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
However, as a simplification of real-world problems, the first-order random walk is poor at modeling higher-order structures in the data. ...
., 𝑆 𝑀 } of sequences, the Shortest Common Supersequence of 𝑅, SCS(𝑅), is a shortest sequence 𝑆 ′ such that 𝑆 ′ > 𝑆 𝑖 , 𝑖 = 1, 2, ..., 𝑀. ...
We write 𝑆 ′ > 𝑆 if 𝑆 ′ is a supersequence of 𝑆. ...
arXiv:2203.16123v1
fatcat:ijfhquus7jhwpoqzgu4ilw44s4
Ant colony optimization for the single model U-type assembly line balancing problem
2009
International Journal of Production Economics
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.
In this research, a new heuristic, Ant Colony Optimization (ACO) meta-heuristic, and its variants are proposed for the single model U-type assembly line balancing problem (UALBP). ...
The assembly line balancing problem is the allocation of tasks to an ordered sequence of stations subject to the precedence constraints with the objective of minimizing the number of stations. ...
Quadratic assignment problem (QAP), Job-shop scheduling problem (JSP), Vehicle routing problem (VRP), Shortest common supersequence problem (SCS), Graph coloring problem (GCP), Sequential ordering problem ...
doi:10.1016/j.ijpe.2008.11.017
fatcat:cpca5qhaejbgxkmlf5ool4ewue
Eye Tracking Scanpath Analysis Techniques on Web Pages: A Survey, Evaluation and Comparison
Journal of Eye Movement Research
unpublished
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 article comprehensively revisits the techniques that could be applicable to eye tracking data for analysing user scanpaths on web pages. ...
techniques can mainly be used for calculating similarities/dissimilarities between scanpaths, computing transition probabilities between web page elements, detecting patterns in scanpaths and identifying common ...
Shortest Common Supersequence. One of these techniques is the Shortest Common Supersequence (SCS) technique (Räihä, 2010) . ...
fatcat:ah4c3ygtjfehle4jjjkwxu3ble
Reference list of indexed articles
1999
Theoretical 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.
Ukkonen, The shortest common supersequence problem over binary alphabet is NP-Lam, M.K. Siu and CT. Yu, A generalized counter scheme 343. W.A. Burkhard, M.L. Fredman and D.J. ...
Ukkonen, A greedy approximation algorithm for constructmg shortest common superstrings 57 (1) (1988) 13 l-145 W. ...
doi:10.1016/s0304-3975(98)00320-x
fatcat:bdgg2ekzdjahdo7g2gtwbdye6m
The Impact of the SIMD Width on Control-Flow and Memory Divergence
2015
ACM Transactions on Architecture and Code Optimization (TACO)
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.
In the case of executing k ≤ w work items on a w-wide SIMD processor, determining the shortest SIMD execution corresponds to the shortest common supersequence problem, which is NP-complete in terms of ...
INTRODUCTION Data-parallel languages such as OpenCL or CUDA are a common choice for programming massively parallel compute devices. ...
doi:10.1145/2687355
fatcat:vwrleodlk5hizf5pk6i3qrvqtu
« Previous
Showing results 1 — 15 out of 23 results