Trees (data structures) | String data structures | Substring indices

Generalized suffix tree

In computer science, a generalized suffix tree is a suffix tree for a set of strings. Given the set of strings of total length , it is a Patricia tree containing all suffixes of the strings. It is mostly used in bioinformatics. (Wikipedia).

Generalized suffix tree
Video thumbnail

Primitive Roots - Applied Cryptography

This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.

From playlist Applied Cryptography

Video thumbnail

Primitive Roots Method 2

This video describes what a primitive roots is. Also, how to test if a number (alpha) is primitive for a low/small modulus. Also note that there is a more efficient way of testing for a primitive root (if p-1 is easily factorable), which is discussed in part 2: https://www.youtube.com/wat

From playlist Number Theory

Video thumbnail

Number Theory | Primitive Roots modulo n: Definition and Examples

We give the definition of a primitive root modulo n. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/

From playlist Primitive Roots Modulo n

Video thumbnail

Number Theory | A primitive root for 2*5^n

We find a primitive root for 2*5^n for all natural numbers n. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/

From playlist Primitive Roots Modulo n

Video thumbnail

Number Theory | When are there primitive roots modulo n?

We classify the natural numbers n for which there are primitive roots. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/

From playlist Primitive Roots Modulo n

Video thumbnail

Lecture 5 - Introduction to Suffix Trees

This is Lecture 5 of the CSE549 (Computational Biology) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2010. The lecture slides are available at: http://www.algorithm.cs.sunysb.edu/computationalbiology/pdf/lecture5.pdf More infor

From playlist CSE549 - Computational Biology - 2010 SBU

Video thumbnail

Lecture 6 - Suffix Trees in Action

This is Lecture 6 of the CSE549 (Computational Biology) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2010. The lecture slides are available at: http://www.algorithm.cs.sunysb.edu/computationalbiology/pdf/lecture6.pdf More infor

From playlist CSE549 - Computational Biology - 2010 SBU

Video thumbnail

Live CEOing Ep 53: Tree Structures in the Wolfram Language

Watch Stephen Wolfram and teams of developers in a live, working, language design meeting. This episode is about Tree Structures in the Wolfram Language.

From playlist Behind the Scenes in Real-Life Software Design

Video thumbnail

Number Theory | Primitive roots modulo p -- Technical Lemma 2

We present another technical lemma regarding primitive roots modulo p. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/

From playlist Primitive Roots Modulo n

Video thumbnail

Number Theory | There is a primitive root modulo 2p^n!!

We prove that for any odd prime, there is a primitive root modulo 2p^n. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/

From playlist Primitive Roots Modulo n

Video thumbnail

Nicolas Pouyanne : Sur les mesures stationnaires des VLMC

Abstract : Les chaînes de Markov à mémoire de longueur variable sont des sources probabilistes pour lesquelles la production d'une lettre dépend d'un passé fini, mais dont la longueur dépend du temps est n'est pas bornée. Elles sont définies à partir d'un arbre T qui est un sous-arbre de l

From playlist Probability and Statistics

Video thumbnail

Data Structures Easy to Advanced Course - Full Tutorial from a Google Engineer

Learn and master the most common data structures in this full course from Google engineer William Fiset. This course teaches data structures to beginners using high quality animations to represent the data structures visually. You will learn how to code various data structures together wi

From playlist Java Tutorials

Video thumbnail

Primitive Roots Method 1

The second method for testing whether alpha is a primitive root mod p. Description of primitive roots is in the Primitive Roots pt. 1 video. Questions? Feel free to post them in the comments and I'll do my best to answer!

From playlist Number Theory

Video thumbnail

Lecture 3: Morphology, Part 2

MIT 24.900 Introduction to Linguistics, Spring 2022 Instructor: Prof. Norvin W. Richards View the complete course: https://ocw.mit.edu/courses/24-900-introduction-to-linguistics-spring-2022/ YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63BZGNOqrF2qf_yxOjuG35j This v

From playlist MIT 24.900 Introduction to Linguistics, Spring 2022

Video thumbnail

Lecture 8 - String Matching Algorithms

This is Lecture 8 of the CSE549 (Computational Biology) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2010. The lecture slides are available at: http://www.algorithm.cs.sunysb.edu/computationalbiology/pdf/lecture8.pdf More infor

From playlist CSE549 - Computational Biology - 2010 SBU

Video thumbnail

Lecture 4: Morphology, Part 3

MIT 24.900 Introduction to Linguistics, Spring 2022 Instructor: Prof. Norvin W. Richards View the complete course: https://ocw.mit.edu/courses/24-900-introduction-to-linguistics-spring-2022/ YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63BZGNOqrF2qf_yxOjuG35j This v

From playlist MIT 24.900 Introduction to Linguistics, Spring 2022

Video thumbnail

FREE and BOUND MORPHEMES, AFFIXES - INTRODUCTION to LINGUISTICS

In this video we look at Morphemes, Free Morphemes, Bound Morphemes, then take a look at affixes. These include prefixes, suffixes, and infixes. We then are able to draw word trees, just like in syntax. #Linguistics #Lecture #Morphology Visit our website: http://bit.ly/1zBPlvm Subscribe

From playlist Introduction to Linguistics

Video thumbnail

Number Theory | Definition of the index with respect to a primitive root modulo n.

We give the definition of the index with respect to a primitive root. This is also know as the discrete logarithm. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/

From playlist Primitive Roots Modulo n

Video thumbnail

Lecture 7 - Suffix Arrays and Assembly

This is Lecture 7 of the CSE549 (Computational Biology) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2010. The lecture slides are available at: http://www.algorithm.cs.sunysb.edu/computationalbiology/pdf/lecture7.pdf More infor

From playlist CSE549 - Computational Biology - 2010 SBU

Video thumbnail

Primitive roots modulo n and the structure of U(n)

We review the definition of a primitive root modulo n and apply it to determining the structure of U(n), the group of units modulo n. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/

From playlist Abstract Algebra

Related pages

Suffix tree | Suffix (computer science) | Ukkonen's algorithm | Suffix array | String (computer science)