Approximate Hashing for Bioinformatics

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	CIAA (25. : 2021 : Online) Implementation and Application of Automata
1. Verfasser:	Arbitman, Guy (VerfasserIn)
Weitere Verfasser:	Klein, Shmuel T. (VerfasserIn), Peterlongo, Pierre (VerfasserIn), Shapira, Dana (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Back to the Future: A Fresh Look at Linear Temporal Logic	2021	Esparza, Javier
Degrees of Restriction for Two-Dimensional Automata	2021	Smith, Taylor J.
Boolean Kemels of Context-Free Languages	2021	Kutrib, Martin
Approximate Hashing for Bioinformatics	2021	Arbitman, Guy
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages	2021	Hoffmann, Stefan
Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs	2021	Shallit, Jeffrey
Memoized Regular Expressions	2021	Merwe, Brink van der
Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis	2021	Kim, Su-Hyeon
The Range of State Complexities of Languages Resulting from the Cascade Product—The Unary Case (Extended Abstract)	2021	Holzer, Markus
Guessing the Buffer Bound for k-Synchronizability	2021	Giusto, Cinzia Di
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers	2021	Geneva, Diana
Ambiguity Hierarchies for Weighted Tree Automata	2021	Maletti, Andreas
The Commutative Closure of Shuffle Languages over Group Languages is Regular	2021	Hoffmann, Stefan
State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints	2021	Hoffmann, Stefan
Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton	2021	Faro, Simone