Search results for "string"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
117	Raul Hakli, Matti Nykänen, Hellis Tamm	Adding String Processing Capabilities to Data Management Systems.	SPIRE	2000	DBLP DOI BibTeX RDF	string theory, string processing capabilities, string-oriented application areas, string processing method, string handling, Alignment Declaration language, string relations, finiteness analysis, database management system, query evaluation, information retrieval systems, data management systems, computational molecular biology
103	Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde	On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation.	ASIA-PEPM	2002	DBLP DOI BibTeX RDF	Knuth-Morris-Pratt string matching, data specialization, program specialization, trace semantics
96	Yujiun P. Wang, Theodosios Pavlidis	Optimal Correspondence of String Subsequences.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	string-to-string subsequence, string-to-regular-expression subsequence, string subsequences, optimal correspondent subsequence, finite alphabet editing error minimization matching, infinite alphabet penalty minimization matching, syntactic information, stereo epipolar line matching problem, UPC bar-code recognition, pattern recognition, computational complexity, computational complexity, metric, optimisation, template matching, relaxation, elastic matching, string distance, regular grammar
85	Eric Sven Ristad, Peter N. Yianilos	Learning String-Edit Distance.	IEEE Trans. Pattern Anal. Mach. Intell.	1998	DBLP DOI BibTeX RDF	stochastic transduction, string correction, string classification, pronunciation modeling, Switchboard corpus, syntactic pattern recognition, Levenshtein distance, spelling correction, String-edit distance, string similarity
78	Jeffrey Jestes, Feifei Li 0001, Zhepeng Yan, Ke Yi 0001	Probabilistic string similarity joins.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	approximate string queries, probabilistic strings, string joins
68	Lusheng Wang 0001, Binhai Zhu	Efficient Algorithms for the Closest String and Distinguishing String Selection Problems.	FAW	2009	DBLP DOI BibTeX RDF	the closest string, the farthest string, the distinguishing string selection, Fixed parameter algorithms
68	Rahmat Budiarto, Masashi Yamada, Hirohisa Seki, Hidenori Itoh	A 3-D string figure display system for animating cat's cradle game.	PG	1997	DBLP DOI BibTeX RDF	3D string figure display system, cat's cradle game, finger actions, stabilizing procedure, string dynamics, set-of-crossings representation method, local transformations, topological characteristics, animation, computer animation
66	Shibin Qiu, Terran Lane	The RNA String Kernel for siRNA Efficacy Prediction.	BIBE	2007	DBLP DOI BibTeX RDF
65	Paolo Ferragina, Roberto Grossi	Optimal On-Line Search and Sublinear Time Update in String Matching.	FOCS	1995	DBLP DOI BibTeX RDF	optimal online search, optimal on-line search, sublinear time update, online searching, arbitrary pattern string, indexed text string, arbitrary string, optimal time, occ occurrences, sublinear time per update, computational complexity, pattern matching, string matching, string matching, search problems, word processing, dynamic algorithm, dynamic setting
63	Alexandre Tiskin	Semi-local String Comparison: Algorithmic Techniques and Applications.	Math. Comput. Sci.	2008	DBLP DOI BibTeX RDF	semi-local string comparison, longest common subsequence, String algorithms
63	Jens Groth, Rafail Ostrovsky	Cryptography in the Multi-string Model.	CRYPTO	2007	DBLP DOI BibTeX RDF	Common random string model, multi-string model, universally composable commitment, multi-party computation, non-interactive zero-knowledge
61	Yang Wang	Effects of Suffix Repetition Rates of a String on the Performance of String Matching Algorithms.	ACIS-ICIS	2009	DBLP DOI BibTeX RDF
61	Kilho Shin	Position-Aware String Kernels with Weighted Shifts and a General Framework to Apply String Kernels to Other Structured Data.	IDEAL	2007	DBLP DOI BibTeX RDF
61	Cheng-Lin Liu, Katsumi Marukawa	Handwritten Numeral String Recognition: Character-Level vs. String-Level Classifier Training.	ICPR (1)	2004	DBLP DOI BibTeX RDF
60	Horst Bunke, Xiaoyi Jiang 0001, Karin Abegglen, Abraham Kandel	On the Weighted Mean of a Pair of Strings.	Pattern Anal. Appl.	2002	DBLP DOI BibTeX RDF	Generalised median string, Weighted mean string, String matching, Self-organising feature map, String edit distance
59	Marc Pierrot-Deseilligny, Hervé Le Men, Georges Stamon	Characters string recognition on maps, a method for high level reconstruction.	ICDAR	1995	DBLP DOI BibTeX RDF	character string extraction, string recognition, cartographic context, high level reconstruction process, string coherence, simplifying hypotheses, graph optimization problem, combinatorial exploration, feature extraction, dynamic programming, dynamic programming, graph theory, graph theory, heuristics, knowledge based systems, maps, image reconstruction, character recognition, string matching, industrial application, pattern analysis, cartography
59	Hidekata Hontani, Shigeyoshi Shimotsuji	Character detection based on multi-scale measurement.	ICDAR	1995	DBLP DOI BibTeX RDF	multi-scale measurement, character detection, character string extraction, string detection technique, small black region merging, stable mass searching, split process, judgment process, character recognition, character string, geographical map
57	Ming Li 0001, Bin Ma 0002, Lusheng Wang 0001	On the closest string and substring problems.	J. ACM	2002	DBLP DOI BibTeX RDF	Closest string and substring, polynomial-time approximation scheme, computer applications
57	Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot	Efficient Experimental String Matching by Weak Factor Recognition.	CPM	2001	DBLP DOI BibTeX RDF	information retrieval, string matching, algorithm design, Finite automaton
56	Paolo Ferragina, Roberto Grossi	The String B-tree: A New Data Structure for String Search in External Memory and Its Applications.	J. ACM	1999	DBLP DOI BibTeX RDF	Patricia trie, prefix and range search, string searching and sorting, text index, suffix tree, B-tree, suffix array, external-memory data structure
56	Fang Yu 0001, Tevfik Bultan, Marco Cova, Oscar H. Ibarra	Symbolic String Verification: An Automata-Based Approach.	SPIN	2008	DBLP DOI BibTeX RDF
56	Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan 0001	Static Optimality Theorem for External Memory String Access.	FOCS	2002	DBLP DOI BibTeX RDF
54	William I. Chang, Eugene L. Lawler	Approximate String Matching in Sublinear Expected Time	FOCS	1990	DBLP DOI BibTeX RDF	random string, infrequent errors, sublinear expected time, pattern string, substring matching, dynamic programming, efficient algorithms, genetics, insertions, approximate string matching, deletions, substitutions, differences, molecular biology, text string
53	Alexander Filatov, Alexander Gitis, Igor Kil	Graph-based handwritten digit string recognition.	ICDAR	1995	DBLP DOI BibTeX RDF	graph based handwritten digit string recognition, handwritten digit string recognition algorithm, input subgraph matching, prototype symbol graphs, acceptable graph transformations, handwritten symbols, structure recognition methods, handwritten symbol topology, handwritten digit string recognition system, handwriting recognition
52	Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón	The Max-Shift Algorithm for Approximate String Matching.	WAE	2001	DBLP DOI BibTeX RDF	dynamic programming, edit-distance, approximate string matching, String algorithms
52	Kiyokuni Kawachiya, Kazunori Ogata, Tamiya Onodera	Analysis and reduction of memory inefficiencies in Java strings.	OOPSLA	2008	DBLP DOI BibTeX RDF	footprint analysis and reduction, java, garbage collection, memory management, string
52	Adam Kiezun, Vijay Ganesh, Philip J. Guo, Pieter Hooimeijer, Michael D. Ernst	HAMPI: a solver for string constraints.	ISSTA	2009	DBLP DOI BibTeX RDF	string constraints, regular languages, context-free languages
52	Liang Jin, Chen Li 0001, Rares Vernica	SEPIA: estimating selectivities of approximate string predicates in large Databases.	VLDB J.	2008	DBLP DOI BibTeX RDF	SEPIA, Approximate, Estimation, Selectivity, String
52	Graham Cormode, S. Muthukrishnan 0001	The string edit distance matching problem with moves.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	data streams, embedding, similarity search, string matching, edit distance, Approximate pattern matching
52	Ran Canetti, Rafael Pass, Abhi Shelat	Cryptography from Sunspots: How to Use an Imperfect Reference String.	FOCS	2007	DBLP DOI BibTeX RDF	UC Security, Setup Models, Common Reference String, Non black-box constructions, Entropy
52	Ghada Badr, B. John Oommen	A novel look-ahead optimization strategy for trie-based approximate string matching.	Pattern Anal. Appl.	2006	DBLP DOI BibTeX RDF	Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Branch and bound techniques, Pruning, Approximate string matching
52	Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor 0001	Reconstructing strings from random traces.	SODA	2004	DBLP BibTeX RDF
51	Avraham Goldstein, Petr Kolman, Jie Zheng	Minimum Common String Partition Problem: Hardness and Approximations.	ISAAC	2004	DBLP DOI BibTeX RDF
51	François Nicolas, Eric Rivals	Complexities of the Centre and Median String Problems.	CPM	2003	DBLP DOI BibTeX RDF
51	Gösta Grahne, Emmanuel Waller	How to Make SQL Stand for String Query Language.	DBPL	1999	DBLP DOI BibTeX RDF
50	Heikki Hyyrö	Restricted Transposition Invariant Approximate String Matching Under Edit Distance.	SPIRE	2005	DBLP DOI BibTeX RDF
50	Joong Chae Na, Kunsoo Park	Simple Implementation of String B-Trees..	SPIRE	2004	DBLP DOI BibTeX RDF
50	Robert A. Wagner, Michael J. Fischer	The String-to-String Correction Problem.	J. ACM	1974	DBLP DOI BibTeX RDF
48	Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao	Finding All Approximate Gapped Palindromes.	ISAAC	2009	DBLP DOI BibTeX RDF	palindrome, incremental string comparison, string matching
48	Jin Wook Kim, Siwon Choi, Joong Chae Na, Jeong Seop Sim	Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model.	ISAAC	2009	DBLP DOI BibTeX RDF	consistent superstring, Aho-Corasick algorithm, string inclusion, string non-inclusion
48	Michio Nakanishi, Morio Hasidume, Minoru Ito, Akihiro Hashimoto	A Linear-Time Algorithm for Computing Characteristic Strings.	ISAAC	1994	DBLP DOI BibTeX RDF	characteristic string, DNA probe, suffix tree, approximate string matching
47	Dehui Yuan, Shengyun Yang, Guoming Lai 0002	A Unified String Kernel for Biology Sequence.	ICIC (2)	2008	DBLP DOI BibTeX RDF	unified kernel, improved kernel string, composite kernel string
47	Kimmo Fredriksson, Gonzalo Navarro 0001	Average-optimal single and multiple approximate string matching.	ACM J. Exp. Algorithmics	2004	DBLP DOI BibTeX RDF	multiple string matching, optimality, Algorithms, approximate string matching, biological sequences
47	Christian Häubl, Christian Wimmer, Hanspeter Mössenböck	Optimized strings for the Java HotSpot™ virtual machine.	PPPJ	2008	DBLP DOI BibTeX RDF	Java, optimization, performance, string
47	Cherry Keahey Owen	Tracking system bugs: why are buffer overruns still around?	SIGUCCS	2007	DBLP DOI BibTeX RDF	string overwrite, c programming, buffer overrun
47	Zhenjie Zhang, Marios Hadjieleftheriou, Beng Chin Ooi, Divesh Srivastava	Bed-tree: an all-purpose index structure for string similarity search based on edit distance.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	similarity search, range query, edit distance, string, top-k query, approximate join
47	Alfons Geser	Loops of Superexponential Lengths in One-Rule String Rewriting.	RTA	2002	DBLP DOI BibTeX RDF	uniform termination, one-rule, single-rule Submission category: Regular research paper, termination, loop, string rewriting, semi-Thue system
47	Hans-Martin Blüthgen, Tobias G. Noll	A Programmable Processor for Approximate String Matching with High Throughput Rate.	ASAP	2000	DBLP DOI BibTeX RDF	information retrieval, VLSI, dynamic programming, CMOS, edit distance, approximate string matching
47	Bowon Kim, Kyhyun Um	2D+ String: A Spatial Metadata to Reason Topological and Directional Relationships.	SSDBM	1999	DBLP DOI BibTeX RDF	directional relationship, 2D+ string, metadata, spatial object, topological relationship
46	Behrooz K. Seyed-Abbassi, John C. Thompson	Grammatical relational database model (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
46	Jens Gramm, Rolf Niedermeier, Peter Rossmanith	Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems.	Algorithmica	2003	DBLP DOI BibTeX RDF	Consensus word analysis, NP-complete, Exact algorithms, Fixed-parameter tractability
46	Süleyman Cenk Sahinalp, Murat Tasan, Jai Macker, Z. Meral Özsoyoglu	Distance Based Indexing for String Proximity Search.	ICDE	2003	DBLP DOI BibTeX RDF
45	Fang Yu 0001, Tevfik Bultan, Oscar H. Ibarra	Symbolic String Verification: Combining String Analysis and Size Analysis.	TACAS	2009	DBLP DOI BibTeX RDF
45	Arcot Rajasekar	String-Oriented Databases.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF	query processing, pattern-matching, datalog, relational algebra, approximate reasoning
44	Shibin Qiu, Terran Lane, Cundong Yang	Efficient search algorithms for RNAi target detection.	J. Supercomput.	2007	DBLP DOI BibTeX RDF	RNAi target detection, String inexact matching, Reverse string search, Off-target, siRNA seed region, String kernels
43	Lasse Bergroth, Harri Hakonen, Timo Raita	A Survey of Longest Common Subsequence Algorithms.	SPIRE	2000	DBLP DOI BibTeX RDF	longest common subsequence algorithms, string comparison, data structures, string matching, string matching, execution time, algorithm performance
43	Livio Colussi, Zvi Galil, Raffaele Giancarlo	On the Exact Complexity of String Matching (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	exact complexity, character comparisons, linear-time string matching algorithm, pattern string, online algorithms, text string, alphabet
43	Phill-Kyu Rhee, Jei S. Park, Yeon Gu Kang	Rotation-invariant recognition of character strings for Korean cadastral map digitizing.	ICDAR	1995	DBLP DOI BibTeX RDF	recognition of character strings, Korean cadastral map digitizing, cadastral maps, rotated character strings, character recognition, document image processing, cartography, engineering drawings, character string, numeral string recognition, map recognition
42	Lin Tan 0001, Timothy Sherwood	Architectures for Bit-Split String Scanning in Intrusion Detection.	IEEE Micro	2006	DBLP DOI BibTeX RDF	Bit-split string, intrusion detection, string matching
42	Hsi-Chieh Lee, Fikret Erçal	RMESH Algorithms for Parallel String Matching.	ISPAN	1997	DBLP DOI BibTeX RDF	Reconfigurable Mesh Architecture, RMESH, Parallel Algorithms, String Matching, Approximate String Matching
42	John T. Favata	General word recognition using approximate segment-string matching.	ICDAR	1997	DBLP DOI BibTeX RDF	isolated off-line general word recognition, approximate stroke-segment/string matching algorithm, OCR estimates, character sequence, lexicon words, document noise, poor handwriting, lexicon errors, recognition failure, segment-to-string matching algorithm, system errors, post-processing module, degraded document recognition, character model word recognizer, CMWR algorithm, optical character recognition, text recognition, cursive script recognition, BEAM search, image degradation
42	Raghu Sastry, N. Ranganathan, Klinton Remedios	CASM: A VLSI Chip for Approximate String Matching.	IEEE Trans. Pattern Anal. Mach. Intell.	1995	DBLP DOI BibTeX RDF	Edit distance computation, string-to-string correction problem, very large scale integration (VLSI) implementation, hardware algorithm, systolic algorithm, special purpose architecture
42	S. Viswanadha Raju, S. R. Mantena, A. Vinaya Babu, G. V. S. Raju 0003	Efficient Parallel Pattern Matching Using Partition Method.	PDCAT	2006	DBLP DOI BibTeX RDF	Boolean matrix, Cellular automata, String matching, Arrays
42	Pei-Chi Wu, Feng-Jian Wang	Padded string: treating string as sequence of machine words.	ACM SIGPLAN Notices	1994	DBLP DOI BibTeX RDF	string sorting, data structure, C, string
42	Walter F. Tichy	The String-to-String Correction Problem with Block Moves	ACM Trans. Comput. Syst.	1984	DBLP DOI BibTeX RDF	block moves, revision control, source control, string deltas, pattern matching, longest common subsequences, string edits
41	Bryant A. Julstrom	A data-based coding of candidate strings in the closest string problem.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	closest string problem, data-based coding, genetic algorithm
41	Rahul Jain 0001	New Binding-Concealing Trade-Offs for Quantum String Commitment.	J. Cryptol.	2008	DBLP DOI BibTeX RDF	String commitment, Quantum channels, Observational divergence, Substate theorem, Relative entropy
41	Chunmei Liu, Yinglei Song, Legand L. Burge III	Parameterized lower bound and inapproximability of polylogarithmic string barcoding.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Polylogarithmic string barcoding, Parameterized lower bound, Inapproximability
41	Charu C. Aggarwal, Philip S. Yu	On string classification in data streams.	KDD	2007	DBLP DOI BibTeX RDF	classification, hidden markov models, string
41	Nicole Beebe, Glenn B. Dietrich	A New Process Model for Text String Searching. (PDF / PS)	IFIP Int. Conf. Digital Forensics	2007	DBLP DOI BibTeX RDF	Text string search, information retrieval, text mining, process model
41	Karl Chen, David A. Wagner 0001	Large-scale analysis of format string vulnerabilities in Debian Linux.	PLAS	2007	DBLP DOI BibTeX RDF	format string vulnerability, large-scale analysis, type-qualifier inference
41	Abdolreza Mirzaei, Hamidreza Zaboli, Reza Safabakhsh	A Neural Network String Matcher.	CAIP	2007	DBLP DOI BibTeX RDF	TCNN, Optimization using Hopfield NN, Parallel, String matching, Chaotic Neural Network
41	Zhanyi Liu, Haifeng Wang 0001, Hua Wu 0003	Example-based machine translation based on tree-string correspondence and statistical generation.	Mach. Transl.	2006	DBLP DOI BibTeX RDF	Translation example, Tree-string correspondence, Statistical generation, Example-based machine translation
41	Ranjan Sinha, Justin Zobel, David Ring	Cache-efficient string sorting using copying.	ACM J. Exp. Algorithmics	2006	DBLP DOI BibTeX RDF	algorthims, string management, cache, Sorting, tries, experimental algorithms
41	Lin Tan 0001, Brett Brotherton, Timothy Sherwood	Bit-split string-matching engines for intrusion detection and prevention.	ACM Trans. Archit. Code Optim.	2006	DBLP DOI BibTeX RDF	String-matching architecture, state machine splitting, security
41	Gábor Blaskó, Chandra Narayanaswami, Steven Feiner	Prototyping retractable string-based interaction techniques for dual-display mobile devices.	CHI	2006	DBLP DOI BibTeX RDF	pixel-array displays, retractable string-based input, mobile computing, wearable computing, mobile interaction
41	S. Viswanadha Raju, A. Vinaya Babu, M. Mrudula	Backend Engine for Parallel String Matching Using Boolean Matrix.	PARELEC	2006	DBLP DOI BibTeX RDF	Boolean matrix, string matching, processor, Arrays, layered architecture
41	Peter Thiemann 0001	Grammar-based analysis of string expressions.	TLDI	2005	DBLP DOI BibTeX RDF	string expression analysis, constraints, type inference
41	Christina S. Leslie, Rui Kuang	Fast Kernels for Inexact String Matching.	COLT	2003	DBLP DOI BibTeX RDF	Kernel methods, computational biology, string kernels
41	Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa	Bit-Parallel Approach to Approximate String Matching in Compressed Texts.	SPIRE	2000	DBLP DOI BibTeX RDF	compressed texts, collage system, dictionary-based compression methods, machine word, pattern length, allowed errors, dictionary size, token sequence, Ziv-Lempel compression methods, compressed length, data compression, time complexity, space complexity, approximate string matching, bit-parallelism
41	Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim	Consensus Optimizing Both Distance Sum and Radius.	SPIRE	2009	DBLP DOI BibTeX RDF
41	Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz	Interchange Rearrangement: The Element-Cost Model.	SPIRE	2008	DBLP DOI BibTeX RDF	Interchange rearrangement, Cost models
41	Bratati Banerjee	String Tightening as a Self-Organizing Phenomenon.	IEEE Trans. Neural Networks	2007	DBLP DOI BibTeX RDF
41	Wei Li 0020, Tzi-cker Chiueh	Automated Format String Attack Prevention for Win32/X86 Binaries.	ACSAC	2007	DBLP DOI BibTeX RDF
41	Sreenivas Gollapudi, Rina Panigrahy	A dictionary for approximate string search and longest prefix search.	CIKM	2006	DBLP DOI BibTeX RDF	hamming space, embeddings
41	Dekel Tsur	Tight Bounds for String Reconstruction Using Substring Queries.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
41	Graham Cormode, S. Muthukrishnan 0001	The string edit distance matching problem with moves.	SODA	2002	DBLP BibTeX RDF
41	Jens Gramm, Rolf Niedermeier, Peter Rossmanith	Exact Solutions for CLOSEST STRING and Related Problems.	ISAAC	2001	DBLP DOI BibTeX RDF
41	Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin	String Operations in Query Languages. (PDF / PS)	PODS	2001	DBLP DOI BibTeX RDF
41	Carlos D. Martínez-Hinarejos, Alfons Juan, Francisco Casacuberta	Use of Median String for Classification .	ICPR	2000	DBLP DOI BibTeX RDF
41	Dany Breslauer, Livio Colussi, Laura Toniolo	On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract).	ESA	1994	DBLP DOI BibTeX RDF
41	S. Muthukrishnan 0001, H. Ramesh	String Matching Under a General Matching Relation.	FSTTCS	1992	DBLP DOI BibTeX RDF
41	Ken C. Liu, Arthur C. Fleck	String Pattern Matching in Polynomial Time.	POPL	1979	DBLP DOI BibTeX RDF
38	Jacob O. Wobbrock, Brad A. Myers	Analyzing the input stream for character- level errors in unconstrained text entry evaluations.	ACM Trans. Comput. Hum. Interact.	2006	DBLP DOI BibTeX RDF	input stream, minimum string distance, nonrecognition, optimal alignment, presented string, recognizer, stream alignment, transcribed string, gesture, character recognition, Text entry, text input, stroke, error rate, insertion, deletion, substitution, confusion matrix, EdgeWrite, omission
38	Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara	Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.	ISAAC	2001	DBLP DOI BibTeX RDF	fragmentary pattern, string resemblance, polynomial-time approximation, NP-completeness, string matching
37	Juan M. Huerta	A stack decoder approach to approximate string matching.	SIGIR	2010	DBLP DOI BibTeX RDF	stack decoder, string matching, A* search, string edit distance
37	Cristian Olivares-Rodríguez, José Oncina	A Stochastic Approach to Median String Computation.	SSPR/SPR	2008	DBLP DOI BibTeX RDF	Median String, (Multi)string, Stochastic Edit Distance
37	Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro 0001	Increased bit-parallelism for approximate and multiple string matching.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	multiple string matching, Approximate string matching, bit-parallelism
37	Austin Donnelly, Tim Deegan	IP Route Lookups as String Matching.	LCN	2000	DBLP DOI BibTeX RDF	IP route lookups, destination address, routing table encoding, optimal representation, longest-prefix match problem, transport protocols, string matching, string matching, finite automata, telecommunication network routing, table lookup, finite state automata, state reduction
37	Ville Laurikari	NFAs with Tagged Transitions, Their Conversion to Deterministic Automata and Application to Regular Expressions.	SPIRE	2000	DBLP DOI BibTeX RDF	tagged transitions, automata conversion, input string position tracking, last-use tracking, nondeterministic Mealy machines, string processing, substring addressing, lookahead operator, regular expressions, finite automata, formal semantics, deterministic automata, nondeterministic finite automata