Substring - PDFSEARCH.IO - Document Search Engine

Substring
Results: 165

#	Item
41	Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern Ian Harrower School of Computer Science University of Waterloo Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2005-07-08 16:21:37 Approximation algorithm Computational complexity theory Substring Computing Hamming distance Optimization problem Mathematics Theoretical computer science String
42	Periodic string comparison Alexander Tiskin Department of Computer Science University of Warwick http://www.dcs.warwick.ac.uk/~tiskin Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-23 11:25:22 Dynamic programming Data types Approximate string matching Pattern matching Substring String searching algorithm Matrix Algorithm Factorial Mathematics Combinatorics String
43	Approximate All–Pairs Suffix/Prefix Overlaps Niko Välimäki Department of Computer Science University of Helsinki Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:30 String Substring
44	Compressed Subsequence Matching and Packed Tree Coloring Philip Bille, Patrick Hagge Cording, and Inge Li Gørtz DTU Compute, Technical University of Denmark, CPM, Moscow Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-14 17:29:44 Mathematics Path decomposition Theoretical computer science Applied mathematics Binary trees Optimal control Dynamic programming String Substring
45	Motivation Dynamic FCST’s Conclusions Dynamic Fully-Compressed Suffix Trees Lu´ıs M. S. Russo Gonzalo Navarro Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-12 22:00:30 Suffix tree Searching Longest common substring problem String Search engine indexing Information science Information retrieval Combinatorics
46	Time-Space Trade-Offs for the Longest Common Substring Problem Tatiana Starikovskaya1 and Hjalte Wedel Vildhøj2 1 Moscow State University, Department of Mechanics and Mathematics, Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2013-07-10 03:07:54 Applied mathematics Combinatorics Longest common subsequence problem Substring Longest common substring problem Suffix tree Dynamic programming Mathematics Theoretical computer science
47	CPMPrefix-Free Regular-Expression Matching Yo-Sub Han∗ , Yajun Wang and Derick Wood Department of Computer Science Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2005-07-08 16:23:53 Theoretical computer science Combinatorics Pattern matching Regular expression Matching Substring String Regular language Approximate string matching Formal languages Automata theory Mathematics
48	Microsoft PowerPoint - CPM2010.pptx Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:58 Suffix tree Suffix array Compressed suffix array Search engine indexing Compressed data structure Trie Diminutive Summation Substring index Information science Information retrieval Information
49	c 2009 International Press COMMUNICATIONS IN INFORMATION AND SYSTEMS Vol. 9, No. 3, pp, 2009 Add to Reading List Source URL: www.ims.cuhk.edu.hk Language: English - Date: 2009-11-16 18:53:14 Science Computational phylogenetics Computing Pattern matching String Substring Regular expression Multiple sequence alignment Nucleic acid sequence Mathematics Bioinformatics Formal languages
50	CS109B Notes for LectureNondeterministic Automata Looking for Substrings We can build an NFA to recognize a string that ends in any given substring a1a2 a if we: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:53 Combinatorics Mathematics Regular expression Regular language String Powerset construction Concatenation Finite-state machine Deterministic finite automaton Formal languages Automata theory Theoretical computer science