Indeterminate string factorizations and degenerate text transformations

DOI10.1007/S11786-016-0285-XMaRDI QIDQ2363995zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 17 July 2017

Published in Mathematics in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11786-016-0285-x

zbMATH Keywords

degenerate biological stringdegenerate Burrows-Wheeler transformindeterminate Lyndon wordindeterminate suffix arrayinverse transformlex-extension orderlinear

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32) Protein sequences, DNA sequences (92D20)

Recommendations

• Inferring strings from Lyndon factorization
• Inferring Strings from Lyndon Factorization
• String factorisations with maximum or minimum dimension
• A new approach to regular \& indeterminate strings
• scientific article; zbMATH DE number 7651108
• Degenerate string comparison and applications
• Computing equality-free string factorisations
• Lyndon-like and V-order factorizations of strings
• Indeterminate string inference algorithms
• PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS

Cites work

• A bijective variant of the Burrows-Wheeler transform using V-order
• A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
• A four-stage algorithm for updating a Burrows-Wheeler transform
• A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
• A note on the Burrows-Wheeler transformation
• Combinatorial Pattern Matching
• Factorizing words over an ordered alphabet
• Fast parallel Lyndon factorization with applications
• Finite automata based algorithms on subsequences and supersequences of degenerate strings
• Free differential calculus. IV: The quotient groups of the lower central series
• scientific article; zbMATH DE number 417855 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• Lightweight LCP Construction for Next-Generation Sequencing Datasets
• Lyndon-like and V-order factorizations of strings
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• On Burnside's Problem
• On Burnside's Problem. II
• Periodic musical sequences and Lyndon words
• PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
• Simple real-time constant-space string matching
• Space efficient linear time construction of suffix arrays
• Succinct 2D dictionary matching
• The constrained longest common subsequence problem
• Two-way string-matching

Cited in

(5)

• Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
• Inferring Strings from Lyndon Factorization
• On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
• \(V\)-words, Lyndon words and substring circ-UMFFs
• A unifying taxonomy of pattern matching in degenerate strings and founder graphs

Describes a project that uses

Uses Software

• Soap
• BWA

This page was built for publication: Indeterminate string factorizations and degenerate text transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363995)