Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Gad M. Landau - MaRDI portal

Gad M. Landau

From MaRDI portal
Person:293427

Available identifiers

zbMath Open landau.gad-mWikidataQ19895706 ScholiaQ19895706MaRDI QIDQ293427

List of research outcomes

PublicationDate of PublicationType
Reconstructing parameterized strings from parameterized suffix and LCP arrays2024-02-23Paper
Reconstructing parameterized strings from parameterized suffix and LCP arrays2023-08-04Paper
Double string tandem repeats2023-04-21Paper
https://portal.mardi4nfdi.de/entity/Q58744282023-02-07Paper
On Indeterminate Strings Matching.2023-02-07Paper
Top Tree Compression of Tries.2023-02-03Paper
Cartesian Tree Matching and Indexing2022-07-18Paper
Lower bounds for the number of repetitions in 2D strings2022-06-15Paper
Top tree compression of tries2022-01-18Paper
https://portal.mardi4nfdi.de/entity/Q50051702021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50095592021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50027402021-07-28Paper
Finding patterns and periods in Cartesian tree matching2020-10-22Paper
Finding periods in Cartesian tree matching2020-02-25Paper
Two-dimensional maximal repetitions2020-02-20Paper
Period recovery of strings over the Hamming and edit distances2018-02-16Paper
The nearest colored node in a tree2018-02-16Paper
String cadences2017-11-06Paper
Locating maximal approximate runs in a string2017-10-17Paper
The Nearest Colored Node in a Tree2017-10-17Paper
https://portal.mardi4nfdi.de/entity/Q53650492017-09-29Paper
On Cartesian trees and range minimum queries2017-05-17Paper
Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings2017-02-06Paper
Fast computation of a string duplication history under no-breakpoint-reuse2017-01-13Paper
Online timestamped text indexing2016-06-16Paper
Sequence similarity measures based on bounded Hamming distance2016-06-16Paper
Longest common extensions in trees2016-06-16Paper
Efficient special cases of pattern matching with swaps2016-06-09Paper
Period Recovery over the Hamming and Edit Distances2016-05-03Paper
Binary jumbled pattern matching on trees and tree-like structures2015-11-19Paper
Dynamic text and static pattern matching2015-09-02Paper
Longest Common Extensions in Trees2015-08-20Paper
Range Minimum Query Indexes in Higher Dimensions2015-08-20Paper
Random Access to Grammar-Compressed Strings and Trees2015-06-11Paper
Tree compression with top trees2015-06-09Paper
Computing the Burrows-Wheeler transform in place and in small space2015-05-04Paper
A PTAS for the square tiling problem2014-12-02Paper
Range LCP2014-06-10Paper
Detecting approximate periodic patterns2014-03-13Paper
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures2013-09-17Paper
Tree Compression with Top Trees2013-08-06Paper
Locating All Maximal Approximate Runs in a String2013-06-14Paper
A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform2013-06-14Paper
Detecting Approximate Periodic Patterns2013-04-19Paper
Unified compression-based acceleration of edit-distance computation2013-03-05Paper
NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES2013-02-21Paper
An efficient algorithm to test square-freeness of strings compressed by straight-line programs2012-10-23Paper
Local Exact Pattern Matching for Non-fixed RNA Structures2012-08-14Paper
https://portal.mardi4nfdi.de/entity/Q53900052012-04-24Paper
Range LCP2011-12-16Paper
Efficient algorithms for consensus string problems minimizing both distance sum and radius2011-10-10Paper
Fast RNA structure alignment for crossing input structures2011-05-03Paper
LCS approximation via embedding into locally non-repetitive strings2011-04-28Paper
Indexing a Dictionary for Subset Matching Queries2010-05-04Paper
Algorithms and Data Structures2010-04-20Paper
Two-Dimensional Pattern Matching with Rotations2010-04-06Paper
Sparse LCS Common Substring Alignment2010-04-06Paper
Construction of Aho Corasick automaton in linear time for integer alphabets2010-01-18Paper
Interchange rearrangement: the element-cost model2009-10-09Paper
Scaled and permuted string matching2009-08-27Paper
On Cartesian Trees and Range Minimum Queries2009-07-14Paper
Sparse LCS common substring alignment2009-07-09Paper
LCS Approximation via Embedding into Local Non-repetitive Strings2009-07-07Paper
Fast RNA Structure Alignment for Crossing Input Structures2009-07-07Paper
Haplotype Inference Constrained by Plausible Haplotype Data2009-07-07Paper
Computing similarity of run-length encoded strings with affine gap penalty2008-07-10Paper
Approximating the 2-interval pattern problem2008-07-10Paper
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes2007-09-14Paper
Two algorithms for LCS consecutive suffix alignment2007-08-27Paper
String Processing and Information Retrieval2006-10-24Paper
String Processing and Information Retrieval2006-10-24Paper
Algorithms – ESA 20052006-06-27Paper
Sparse normalized local alignment2006-03-21Paper
Combinatorial Pattern Matching2005-12-14Paper
Combinatorial Pattern Matching2005-12-14Paper
Combinatorial Pattern Matching2005-12-14Paper
Combinatorial Pattern Matching2005-09-07Paper
Combinatorial Pattern Matching2005-09-07Paper
https://portal.mardi4nfdi.de/entity/Q30247762005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q48290012004-11-29Paper
Two-dimensional pattern matching with rotations2004-10-27Paper
Efficient text fingerprinting via Parikh mapping2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44713832004-07-28Paper
Inplace 2D matching in compressed images2004-03-14Paper
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices2004-01-08Paper
Inplace run-length 2d compressed search.2003-08-17Paper
Edit distance of run-length encoded strings.2003-01-21Paper
On the Common Substring Alignment Problem2002-07-08Paper
Text Indexing and Dictionary Matching with One Error2001-04-02Paper
https://portal.mardi4nfdi.de/entity/Q49527032001-04-01Paper
Pattern Matching with Swaps2000-12-19Paper
Parallel algorithms for contour extraction and coding on an EREW PRAM computer2000-08-01Paper
https://portal.mardi4nfdi.de/entity/Q49527052000-05-10Paper
Matching for run-length encoded strings1999-05-11Paper
Incremental String Comparison1998-05-10Paper
Parallel Suffix–Prefix-Matching Algorithm and Applications1996-11-07Paper
Pattern matching in a digitized image1996-02-26Paper
https://portal.mardi4nfdi.de/entity/Q48584421995-12-13Paper
https://portal.mardi4nfdi.de/entity/Q47634331995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q31389111994-09-20Paper
Identifying periodic occurrences of a template with applications to protein structure1993-05-16Paper
An efficient algorithm for the all pairs suffix-prefix problem1992-09-26Paper
Efficient pattern matching with scaling1992-06-28Paper
Fast parallel and serial multidimensional approximate array matching1991-01-01Paper
The power of multimedia: Combining point-to-point and multi-access networks1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42063931990-01-01Paper
Fast parallel and serial approximate string matching1989-01-01Paper
Parallel construction of a suffix tree with applications1988-01-01Paper
Fast string matching with k differences1988-01-01Paper
Distributed algorithms in synchronous broadcasting networks1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37836051987-01-01Paper
Efficient string matching with k mismatches1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37534601985-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Gad M. Landau