Gad Landau
#77,523
Most Influential Person Now
Israeli computer scientist
Gad Landau's AcademicInfluence.com Rankings
Gad Landaumathematics Degrees
Mathematics
#7682
World Rank
#10423
Historical Rank
Complexity Theory
#19
World Rank
#19
Historical Rank
Measure Theory
#3328
World Rank
#3932
Historical Rank
Download Badge
Computer Science Mathematics
Why Is Gad Landau Influential?
(Suggest an Edit or Addition)According to Wikipedia, Gad Menahem Landau is an Israeli computer scientist noted for his contributions to combinatorial pattern matching and string algorithms and is the founding department chair of the Computer Science Department at the University of Haifa.
Gad Landau's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Fast Parallel and Serial Approximate String Matching (1989) (346)
- An Algorithm for Approximate Tandem Repeats (1993) (220)
- Fast String Matching with k Differences (1988) (210)
- Efficient String Matching with k Mismatches (2018) (191)
- Incremental String Comparison (1998) (181)
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices (2003) (141)
- Introducing efficient parallelism into approximate string matching and a new serial algorithm (1986) (137)
- Sequence complexity profiles of prokaryotic genomic sequences: A fast algorithm for calculating linguistic complexity (2002) (93)
- Efficient pattern matching with scaling (1990) (91)
- On Cartesian Trees and Range Minimum Queries (2009) (90)
- Random Access to Grammar-Compressed Strings and Trees (2015) (84)
- An Efficient Algorithm for the All Pairs Suffix-Prefix Problem (1992) (79)
- Efficient string matching in the presence of errors (1985) (76)
- Random access to grammar-compressed strings (2010) (76)
- An Extension of the Vector Space Model for Querying XML Documents via XML Fragments 1 (2002) (72)
- Dynamic text and static pattern matching (2003) (70)
- Matching for run-length encoded strings (1997) (68)
- Text Indexing and Dictionary Matching with One Error (2000) (66)
- A sub-quadratic sequence alignment algorithm for unrestricted cost matrices (2002) (66)
- Efficient text fingerprinting via Parikh mapping (2003) (64)
- Parallel construction of a suffix tree with applications (1988) (53)
- A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression (2009) (53)
- Gene Proximity Analysis across Whole Genomes via PQ Trees1 (2005) (50)
- Fast parallel and serial multidimensional approximate array matching (1990) (49)
- Tree Compression with Top Trees (2013) (47)
- On the Common Substring Alignment Problem (2001) (46)
- Two-dimensional pattern matching with rotations (2003) (43)
- Construction of Aho Corasick automaton in linear time for integer alphabets (2005) (42)
- Pattern matching in a digitized image (1992) (42)
- Approximating the 2-interval pattern problem (2005) (41)
- Edit distance of run-length encoded strings (2002) (40)
- Pattern matching with swaps (1997) (40)
- Permutation Pattern Discovery in Biosequences (2004) (39)
- Optimal parallel suffix-prefix matching algorithm and applications (1989) (36)
- Binary Jumbled Pattern Matching on Trees and Tree-Like Structures (2013) (36)
- Optimal spaced seeds for faster approximate string matching (2005) (34)
- Identifying Periodic Occurrences of a Template with Applications to Protein Structures (1992) (33)
- Scaled and permuted string matching (2004) (33)
- An efficient string matching algorithm with k differences for nucleotide and amino acid sequences (2018) (33)
- Efficient Special Cases of Pattern Matching with Swaps (1998) (32)
- Fast Parallel and Serial Multidimensional Aproximate Array Matching (1991) (31)
- Two algorithms for LCS Consecutive Suffix Alignment (2004) (31)
- Restricted LCS (2010) (31)
- A Combinatorial Approach to Automatic Discovery of Cluster-Patterns (2003) (29)
- Using PQ Trees for Comparative Genomics (2005) (27)
- Inplace run-length 2d compressed search (2000) (25)
- Sequence similarity measures based on bounded hamming distance (2016) (23)
- Indexing and Dictionary Matching with One Error (1999) (23)
- Parallel Construction of a Suffix Tree (Extended Abstract) (1987) (23)
- Sparse LCS Common Substring Alignment (2003) (22)
- Conservative String Covering of Indeterminate Strings (2008) (21)
- Inplace 2D matching in compressed images (2003) (21)
- Unified Compression-Based Acceleration of Edit-Distance Computation (2010) (19)
- A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform (2013) (18)
- Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings (2014) (17)
- Computing the Burrows-Wheeler transform in place and in small space (2015) (17)
- Parallel Suffix-Prefix-Matching Algorithm and Applications (1996) (17)
- The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks (2018) (16)
- Range LCP (2011) (16)
- Cartesian Tree Matching and Indexing (2019) (16)
- ExpaRNA-P: simultaneous exact pattern matching and folding of RNAs (2014) (15)
- Re-Use Dynamic Programming for Sequence Alignment: An Algorithmic Toolkit (2005) (14)
- Binary Jumbled Pattern Matching via All-Pairs Shortest Paths (2014) (14)
- On Approximating String Selection Problems with Outliers (2012) (14)
- Parallel (pram erew) algorithms for contour-based 2D shape recognition (1991) (14)
- Historical queries along multiple lines of time evolution (1995) (13)
- Interchange rearrangement: The element-cost model (2008) (13)
- Online timestamped text indexing (2002) (13)
- Locating alignments with k differences for nucleotide and amino acid sequences (1988) (12)
- Locality and Gaps in RNA Comparison (2007) (12)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (2011) (12)
- Haplotype Inference Constrained by Plausible Haplotype Data (2009) (10)
- On the Complexity of Sparse Exon Assembly (2005) (10)
- Can dist tables be merged in linear time - An Open Problem (2006) (9)
- Sparse Normalized Local Alignment (2004) (9)
- Consensus Optimizing Both Distance Sum and Radius (2009) (9)
- Local Exact Pattern Matching for Non-Fixed RNA Structures (2012) (9)
- LCS approximation via embedding into locally non-repetitive strings (2011) (8)
- Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (2002) (8)
- Parallel algorithms for contour extraction and coding on an EREW PRAM computer (1990) (8)
- Longest Common Extensions in Trees (2014) (7)
- Local Alignment of RNA Sequences with Arbitrary Scoring Schemes (2006) (7)
- Fast RNA Structure Alignment for Crossing Input Structures (2009) (7)
- Top Tree Compression of Tries (2019) (7)
- Identifying periodic occurences of a template with applications to protein structure: Information Processing Letters 45 (1) (25 January 1993) 11-18 (1993) (7)
- STREPTOCOCCAL M PROTEIN: A COMMON STRUCTURAL MOTIF USED BY GRAM· POSITIVE BACTERIA FOR BIOLOGICALLY ACTIVE SURFACE MOLECULES (1992) (7)
- Exact Pattern Matching for RNA Structure Ensembles (2012) (7)
- Two-Dimensional Maximal Repetitions (2020) (7)
- Computing similarity of run-length encoded strings with affine gap penalty (2005) (7)
- Period recovery of strings over the Hamming and edit distances (2017) (6)
- Using parallel string matching algorithms for contour based 2-D shape recognition (1990) (6)
- Fast alignment of DNA and protein sequences. (1990) (6)
- A Faster Construction of Greedy Consensus Trees (2017) (6)
- Parallel algorithms for contour extraction and coding (1990) (6)
- Locating All Maximal Approximate Runs in a String (2013) (6)
- Normalized Similarity of RNA Sequences (2005) (5)
- The power of multimedia: combining point-to point and multi-access networks (1988) (5)
- Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2001) (5)
- On Indeterminate Strings Matching (2020) (5)
- Finding patterns and periods in Cartesian tree matching (2020) (5)
- The nearest colored node in a tree (2017) (5)
- An efficient string matching algorithm with K substitutions for nucleotide and amino acid sequences. (1987) (5)
- Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract) (1985) (5)
- Prague Stringology Conference 2008 (2008) (4)
- Parallel computable contour based feature strings for 2-D shape recognition (1991) (4)
- Efficient support of historical queries for multiple lines of evolution (1993) (4)
- Two Dimensional Pattern Matching in a Digitized Image (1993) (4)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (2012) (4)
- Approximation algorithm for the cyclic swap problem (2005) (4)
- On the shared substring alignment problem (2000) (4)
- String cadences (2016) (3)
- Detecting approximate periodic patterns (2012) (3)
- Fast entropy-bounded string dictionary look-up with mismatches (2018) (3)
- Period Recovery over the Hamming and Edit Distances (2016) (3)
- Combinatorial Pattern Matching (2001) (3)
- EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order (2018) (2)
- Efficient Parallel and Serial Approximate String Matching (2011) (2)
- Indexing a Dictionary for Subset Matching Queries (2007) (2)
- Double String Tandem Repeats (2022) (2)
- LCS Approximation via Embedding into Local Non-repetitive Strings (2009) (2)
- A Faster Construction of Phylogenetic Consensus Trees (2017) (2)
- Finding Periods in Cartesian Tree Matching (2019) (2)
- Lower Bounds for the Number of Repetitions in 2D Strings (2021) (1)
- A PTAS for the Square Tiling Problem (2010) (1)
- Fast computation of a string duplication history under no-breakpoint-reuse (2014) (1)
- Distributed Algorithms in Synchronous Broadcasting Networks (1987) (1)
- Contour-based feature strings for 2-D shape recognition using EREW PRAM architecture (1990) (1)
- Similarity between Compressed Strings (2008) (1)
- A Sub-quadrati Sequen e Alignment Algorithm for Unrestri ted S oring Matri es (2013) (1)
- Locating maximal approximate runs in a string (2017) (1)
- On Cartesian Trees and Range Minimum Queries (2012) (1)
- Binary Jumbled Pattern Matching on Trees and Tree-Like Structures (2014) (0)
- Approximate string searching (1997) (0)
- ExpaRNA-P: simultaneous exact pattern matching and folding of RNAs (2014) (0)
- Order-Preserving Squares in Strings (2023) (0)
- Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract) (2011) (0)
- Efficient Approximation of Large LCS in Strings Over Not Small Alphabet (2008) (0)
- Approximate Runs - Revisited (2008) (0)
- Alphabet Permutation for Differentially Encoding Text (2004) (0)
- Permutation Pattern Discovery in Biosequences ∗ Revital Eres (0)
- Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure (1993) (0)
- Improved Compression-Based Acceleration of Edit-Distance Computation (2009) (0)
- Permutation Pattern Discovery in Biosequences 1 (2005) (0)
- Range Minimum Query Indexes in Higher Dimensions (2015) (0)
- Foreword (2005) (0)
- Foreword (2009) (0)
- Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays (2022) (0)
- Permuted and Scaled String Matching (2004) (0)
- Theoretical Computer Science: Special Issue on CPM '08 (2009) (0)
- Unified Compression-Based Acceleration of Edit-Distance Computation (2011) (0)
- Approximation Algorithm for the Cy li Swap Problem (2020) (0)
- Algorithms on Grammar-Compressed Strings (2011) (0)
- Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings (2008) (0)
This paper list is powered by the following services:
Other Resources About Gad Landau
What Schools Are Affiliated With Gad Landau?
Gad Landau is affiliated with the following schools:
