XXXX, 1–19 © De Gruyter YYYY Subsequences of automatic sequences and uniform distribution

Source URL: www.dmg.tuwien.ac.at

• Elementary mathematics
• Numerical analysis
• Automata theory
• Automatic sequence
• Thue–Morse sequence
• Subsequence
• Equidistributed sequence
• Discrete Fourier transform
• Sequence
• Mathematics
• Mathematical analysis
• Diophantine approximation

Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda Department of Informatics, Kyushu University, JAPAN

Source URL: www.cs.ucr.edu

SUBSEQUENCES OF AUTOMATIC SEQUENCES INDEXED BY ⌊nc ⌋ AND CORRELATIONS JEAN-MARC DESHOUILLERS, MICHAEL DRMOTA, AND JOHANNES F. MORGENBESSER Abstract. The main goal of this paper is to study the behavior of subsequence

Source URL: www.dmg.tuwien.ac.at

• Parity
• Thue–Morse sequence
• Automatic sequence
• Distribution
• Continuous function
• Central limit theorem
• Mathematical analysis
• Mathematics
• Generalized functions

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

Source URL: www.cs.ucr.edu

• Mathematics
• Path decomposition
• Theoretical computer science
• Applied mathematics
• Binary trees
• Optimal control
• Dynamic programming
• String
• Substring

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,

Source URL: www.cs.ucr.edu

• Applied mathematics
• Combinatorics
• Longest common subsequence problem
• Substring
• Longest common substring problem
• Suffix tree
• Dynamic programming
• Mathematics
• Theoretical computer science

Faster Algorithms for Computing Longest Common Increasing Subsequences Gerth Stølting Brodal Kanela Kaligosi

Source URL: www.cs.ucr.edu

• Formal languages
• Longest increasing subsequence
• Subsequence
• Longest common subsequence problem
• Ordinal number
• Ordinal arithmetic
• Mathematics
• Dynamic programming
• Combinatorics

Semi-local string comparison Alexander Tiskin http://www.dcs.warwick.ac.uk/~tiskin Department of Computer Science University of Warwick

Source URL: www.cs.ucr.edu

• String
• Combinatorics
• NP-complete problems
• Formal languages
• Substring
• Longest common subsequence problem
• Subsequence
• Approximate string matching
• String searching algorithm
• Mathematics
• Dynamic programming
• Theoretical computer science

EUROSPEECHGENEVA Automatic Construction of Unique Signatures and Confusable Sets for Natural Language Directory Assistance Applications E.E. Jan, Benoˆıt Maison, Lidia Mangu and Geoffrey Zweig IBM T. J. Watson

Source URL: research.microsoft.com

• Substring
• Subsequence
• Hair care
• Hair
• Mathematical analysis
• Structure
• Mathematics
• Hairdressing
• String

CS109A Notes for LectureSubstrings In ML notation, x is a substring of y if y = u^x^v for some strings u and v.  Similar notion for lists, i.e., y = u@x@v.

Source URL: infolab.stanford.edu

• Combinatorics
• Formal languages
• Longest common subsequence problem
• String
• Substring
• Subsequence
• Diff
• Shortest common supersequence
• Longest common substring problem
• Mathematics
• Dynamic programming
• Theoretical computer science

Microsoft Word - ACIIDS_2010.doc

Source URL: www.itu.dk

• Mathematical logic
• Theoretical computer science
• Subsequence
• K-means clustering
• Pi
• Gaussian function
• Mathematics
• Mathematical analysis
• Algorithm