The Closest Substring problem with small distances ´ Daniel Marx

Source URL: www.cs.bme.hu

The Closest Substring problem with small distances ´ Daniel Marx ¨ zu Berlin

Source URL: www.cs.bme.hu

Closest substring problems with small distances ´ Daniel Marx ¨ zu Berlin

Source URL: www.cs.bme.hu

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.hwv.dk

Solution sheet High Throughput Sequencing Methods Bioinformatics Leipzig WS 13/14 Solution sheet

Source URL: www.bioinf.uni-leipzig.de

• Suffix tree
• Suffix array
• Burrows–Wheeler transform
• Substring
• Eulerian path
• Subsequence
• De Bruijn
• Sequence assembly
• Mathematics
• Mathematical analysis
• Computing

Exercise sheet High Throughput Sequencing Methods Bioinformatics Leipzig WS 13/14 Exercise sheet

Source URL: www.bioinf.uni-leipzig.de

• Arrays
• Suffix array
• Suffix tree
• Burrows–Wheeler transform
• Substring
• FM-index
• String
• De Bruijn
• Computing
• Computer programming
• Mathematics

Computation of Substring Probabilities in Stochastic Grammars Ana L. N. Fred Instituto de Telecomunica
c~oes Instituto Superior Tecnico IST-Torre Norte, Av. Rovisco Pais, Lisboa, Portugal

Source URL: www.lx.it.pt

• Mathematics
• Computing
• Formal languages
• Law of total probability
• Context-free grammar

LNCSComplexity of Approximating Closest Substring Problems

Source URL: rulai.cshl.edu

Machine Translation without Words through Substring Alignment Machine Translation without Words through Substring Alignment Graham Neubig1,2,3, Taro Watanabe2, 1

Source URL: www.phontron.com

Slender PUF Protocol: A Lightweight, Robust, and Secure Authentication by Substring Matching

Source URL: ieee-security.org