scientific article; zbMATH DE number 3240929
From MaRDI portal
zbMath0149.15905MaRDI QIDQ5528329
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A metric index for approximate string matching, Using Hirschberg's algorithm to generate random alignments of strings, Efficient special cases of pattern matching with swaps, Scaled and permuted string matching, LCS\(k\): a refined similarity measure, A re-characterization of the Kemeny distance, \(\mathrm{PSOM}^2\) -- partitioning-based scalable ontology matching using MapReduce, Similarity based deduplication with small data chunks, The \(k\)-dissimilar vehicle routing problem, Constrained string editing, Data repair of inconsistent nonmonotonic description logic programs, Data structures and algorithms for approximate string matching, Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships, Constrained many-to-one string editing with memory, Calculating distances for dissimilar strings: the shortest path formulation revisited, Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes, Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem, A similarity measure for graphs with low computational complexity, An efficient algorithm for sequence comparison with block reversals, Quantitative monitoring of STL with edit distance, Fitness landscape analysis and metaheuristics efficiency, The approximate swap and mismatch edit distance, Approximation of graph edit distance based on Hausdorff matching, On the Varshamov-Tenengolts construction on binary strings, A survey on tree matching and XML retrieval, Block edit models for approximate string matching, Mathematics and flamenco: an unexpected partnership, On the hardness of the consensus string problem, A graph-theoretic model to solve the approximate string matching problem allowing for translocations, Web mining with relational clustering, Optimizing ontology alignments through a memetic algorithm using both MatchFmeasure and unanimous improvement ratio, Simple, compact and robust approximate string dictionary, A new dissimilarity measure for comparing labeled graphs, Overlap matching., Approximate all-pairs suffix/prefix overlaps, Spectral embedding of graphs., Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model, Period recovery of strings over the Hamming and edit distances, Good edit similarity learning by loss minimization, Portfolio symmetry and momentum, Sequence matching with binary codes, An O(NP) sequence comparison algorithm, Efficient algorithms for computing the inner edit distance of a regular language via transducers, String matching with up to \(k\) swaps and mismatches, Bayesian instance selection for the nearest neighbor rule, On measuring similarity for sequences of itemsets, Charge and reduce: A fixed-parameter algorithm for string-to-string correction, Detecting life signatures with RNA sequence similarity measures, An overview on XML similarity: background, current trends and future directions, Pattern matching with address errors: rearrangement distances, Text indexing with errors, Duplication-correcting codes, Algorithms for computing variants of the longest common subsequence problem, Image categorization: Graph edit distance \(+\) edge direction histogram, Spectrum of sizes for perfect 2-deletion-correcting codes of length 4, siEDM: an efficient string index and search algorithm for edit distance with moves, Secure deduplication storage systems supporting keyword search, Text searching allowing for inversions and translocations of factors, A space efficient algorithm for finding the best nonoverlapping alignment score, On searching and indexing sequences of temporal intervals, Approximate string-matching with \(q\)-grams and maximal matches, Real-valued embeddings and sketches for fast distance and similarity estimation, Fifty years of graph matching, network alignment and network comparison, Pattern matching with pair correlation distance, Calibrating AdaBoost for phoneme classification, New efficient algorithms for the LCS and constrained LCS problems, Pattern matching in pseudo real-time, Deciding word neighborhood with universal neighborhood automata, Tandem cyclic alignment, Concordance and consensus, Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching, A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings, The intractability of computing the Hamming distance, Diversity metrics for direct-coded variable-length chromosome shortest path problem evolutionary algorithms, Triangular covers of a digital object, On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability, Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances, Consensus string problem for multiple regular languages, Solving similarity joins and range queries in metric spaces with the list of twin clusters, A universal bound for a covering in regular posets and its application to pool testing, Topology on words, Error graphs and the reconstruction of elements in groups, Comparison of strings belonging to the same family, Feedback insertion-deletion codes, How to choose a fair delegation?, On the longest common parameterized subsequence, An almost-linear time and linear space algorithm for the longest common subsequence problem, An integer linear programming approach for approximate string comparison, Real-time error correction codes for deletable errors, Variable-length codes independent or closed with respect to edit relations, Approximate swapped matching., Edit distance of run-length encoded strings., Decoding algorithms of monotone codes and azinv codes and their unified view, How hard is computing the edit distance?, An algebra of discrete channels that involve combinations of three basic error types, String editing under a combination of constraints, Error-detecting properties of languages, Technical analysis for portofolio trading by syntactic pattern recognition, A fast and practical bit-vector algorithm for the longest common subsequence problem, Approximate matching between a context-free grammar and a finite-state automaton, Research trends in combinatorial optimization, Volume formula and growth rates of the balls of strings under the edit distances, When variable-length codes meet the field of error detection, Matching patterns with variables under edit distance, Deblurring photographs of characters using deep neural networks, Let's enhance: a deep learning approach to extreme deblurring of text images, The distance of random permutation set, Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes, Probabilistic methods of analysis for the time series Moran scatterplot quadrant signature, Covering codes for the fixed length Levenshtein metric, WINTENDED: WINdowed TENsor decomposition for densification event detection in time-evolving networks, Differential privacy for symbolic systems with application to Markov chains, Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework, Quantum complexity for vector domination problem, A robust method for clustering football players with mixed attributes, Topologies for error-detecting variable-length codes, Shuffle squares and reverse shuffle squares, Robust Factorizations and Colorings of Tensor Graphs, Understanding epidemic multi-wave patterns via machine learning clustering and the epidemic renormalization group, Methodology for analyzing bitstreams based on the use of the Damerau-Levenshtein distance and other metrics, GTED: Graph Traversal Edit Distance, Computing the Shortest String and the Edit-Distance for Parsing Expression Languages, Adaptive degraded document image binarization, Edit Distance for Pushdown Automata, State Complexity of Neighbourhoods and Approximate Pattern Matching, How hard is to compute the edit distance, Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs, Algorithms for subsequence combinatorics, Edit distance for a run-length-encoded string and an uncompressed string, Exploiting pseudo-locality of interchange distance, Computing the edit distance of a regular language, Transformer-based deep neural language modeling for construct-specific automatic item generation, The Modular Subset-Sum Problem and the size of deletion correcting codes, Fuzzy clustering of mixed data, On matching of intuitionistic fuzzy sets, Fast similarity search for graphs by edit distance, A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes, Weighted approximate parameterized string matching, Fast String Dictionary Lookup with One Error, Unstructured network topology begets order-based representation by privileged neurons, Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance, Fuzzy concept lattice reduction using Shannon entropy and Huffman coding, Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment, Learn global and optimize local: a data-driven methodology for last-mile routing, Predicting wildlife trafficking routes with differentiable shortest paths, Isometric words based on swap and mismatch distance, Weak inverse neighborhoods of languages, Absent Subsequences in Words, Applications of Gaussian binomials to coding theory for deletion error correction, Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications, Insdel codes from subspace and rank-metric codes, A decision support system for fraud detection in public procurement, On the Longest Common Parameterized Subsequence, Классификация последовательностей на основе коротких мотивов, Construction of single quantum deletion codes via combinatorial conditions and adjacency matrices, Build systems à la carte: Theory and practice, Sequence Alignment Algorithms for Run-Length-Encoded Strings, Unnamed Item, Learning Grammars and Automata with Queries, Levenshtein graphs: resolvability, automorphisms \& determining sets, A Filtering Technique for All Pairs Approximate Parameterized String Matching, Representation and coding of signal geometry, Surprises in approximating Levenshtein distances, Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton, State Complexity of Neighbourhoods and Approximate Pattern Matching, Most pseudo-copy languages are not context-free, Matrices inducing generalized metric on sequences, Deletion correcting codes meet the Littlewood-Offord problem, Public key encryption with fuzzy matching, Extending alignments with \(k\)-mismatches and \(\ell\)-gaps, Constructions of multi-permutation codes correcting a single burst of deletions, Construction of single-deletion-correcting DNA codes using CIS codes, A gift with thoughtfulness: a field experiment on work incentives, The graph matching problem, Estimating sequence similarity from read sets for clustering next-generation sequencing data, Mining relaxed functional dependencies from data, Latent feature extraction for process data via multidimensional scaling, Balanced compact clustering for efficient range queries in metric spaces, Fast robust optimization using bias correction applied to the mean model, Languages with mismatches, Manual and Automated Procedures for Compiling a Very Large Sample of Centenarian Pedigrees, On the Influence of Node Centralities on Graph Edit Distance for Graph Classification, On message protection in cryptosystems modelled as the generalized wire-tap channel II, An Efficient Approach to Merging Paired-End Reads and Incorporation of Uncertainties, A STRUCTURE OF THE NEAREST NEIGHBORS COLLECTIVE IN A FAMILY OF PARTITIONS OF A FINITE SET, Efficient reconstruction of sequences from their subsequences of supersequences, Analogy and Formal Languages, DNA codes for nonadditive stem similarity, Moving coins, Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings, Error-repair parsing schemata, Distance measures for biological sequences: some recent approaches, A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance, An efficient approach for the rank aggregation problem, Fast parallel and serial multidimensional approximate array matching, Descriptional Complexity of Error Detection, A Cooperative Approach for Composite Ontology Mapping, Approaches to visualization in bioinformatics: From dendrograms to space explorer, Fast algorithm and implementation of dissimilarity self-organizing maps, Least-commitment graph matching with genetic algorithms, Mathematical properties of soft cardinality: enhancing Jaccard, Dice and cosine similarity measures with element-wise distance, Similarity of DTDs Based on Edit Distance and Semantics, DNA Codes Based on Stem Similarities Between DNA Sequences, Metrization of the T-alphabet: measuring the distance between multidimensional real discrete sequences, Knowing-how under uncertainty, On bilateral matching between fuzzy sets, Input-driven pushdown automata for edit distance neighborhood, Unnamed Item, Unnamed Item, Planning to Chronicle, Alignment distance of regular tree languages, Quasi-Distances and Weighted Finite Automata, Randomized generation of error control codes with automata and transducers, Synteny Paths for Assembly Graphs Comparison, Refinement of the results of recognition of mathematical formulas using the Levenshtein distance, Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings, Bit-parallel approximate string matching algorithms with transposition, Global and local sequence alignment with a bounded number of gaps, Reverse–Complement Similarity Codes
