On the public citation graph
Parallel construction of a suffix tree with applications
0 signed · 182 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-18088-5_26openalex-snapshot
Parallel construction of a suffix tree
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_1openalex-snapshot
Open Problems in Stringology
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferredcites →https://doi.org/10.1007/bf01955046openalex-snapshot
Data Structures and Algorithms for the String Statistics Problem
inferredcites →https://doi.org/10.1007/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0022-0000(85)90008-xopenalex-snapshot
Routing, merging, and sorting on parallel models of computation
inferredcites →https://doi.org/10.1016/0022-0000(85)90060-1openalex-snapshot
Structural properties of the string statistics problem
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0304-3975(83)90109-3openalex-snapshot
Optimal off-line detection of repetitions in a string
inferredcites →https://doi.org/10.1016/s0019-9958(86)80023-7openalex-snapshot
Deterministic coin tossing with applications to optimal parallel list ranking
inferredcites →https://doi.org/10.1051/ita/1984180201471openalex-snapshot
On context constrained squares and repetitions in a string
inferredcites →https://doi.org/10.1109/sfcs.1986.10openalex-snapshot
Approximate and exact parallel scheduling with applications to list, tree and graph problems
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1109/tc.1983.1676138openalex-snapshot
Searching, Merging, and Sorting in Parallel Computation
inferredcites →https://doi.org/10.1137/0215007openalex-snapshot
The Boyer–Moore–Galil String Searching Strategies Revisited
inferredcites →https://doi.org/10.1145/12130.12152openalex-snapshot
Introducing efficient parallelism into approximate string matching and a new serial algorithm
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/322217.322226openalex-snapshot
Database Location in Computer Networks
inferredcites →https://doi.org/10.1145/800057.808686openalex-snapshot
Randomized speed-ups in parallel computation
inferredcites →https://doi.org/10.1145/800152.804905openalex-snapshot
Rapid identification of repeated patterns in strings, trees and arrays
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470892107.ch1openalex-snapshot
String Data Structures for Computational Molecular Biology
inferred← citeshttps://doi.org/10.1002/spe.535openalex-snapshot
Efficient implementation of lazy suffix trees
inferred← citeshttps://doi.org/10.1006/inco.1995.1047openalex-snapshot
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures
inferred← citeshttps://doi.org/10.1006/inco.1996.0087openalex-snapshot
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications
inferred← citeshttps://doi.org/10.1006/jagm.1996.0814openalex-snapshot
Dynamic Text Indexing under String Updates
inferred← citeshttps://doi.org/10.1006/jagm.1996.0823openalex-snapshot
Sequential and Parallel Approximation of Shortest Superstrings
inferred← citeshttps://doi.org/10.1006/jagm.1996.0844openalex-snapshot
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
inferred← citeshttps://doi.org/10.1006/jagm.1999.1015openalex-snapshot
Simple Optimal Parallel Multiple Pattern Matching
inferred← citeshttps://doi.org/10.1006/jcom.1998.0495openalex-snapshot
On-line Construction of Two-Dimensional Suffix Trees
inferred← citeshttps://doi.org/10.1006/jcom.1998.0496openalex-snapshot
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices
inferred← citeshttps://doi.org/10.1006/jcss.1997.1496openalex-snapshot
Optimal Parallel Suffix Tree Construction
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_5openalex-snapshot
Efficient Implementation of Lazy Suffix Trees
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_5openalex-snapshot
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_29openalex-snapshot
Massively Parallel Suffix Array Construction
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_4openalex-snapshot
PRAM algorithms for identifying polygon similarity
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_36openalex-snapshot
Parallel computations on strings and arrays
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_179openalex-snapshot
String matching with preprocessing of text and pattern
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_19openalex-snapshot
Color Set Size problem with applications to string matching
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_21openalex-snapshot
Efficient randomized dictionary matching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-56346-6_33openalex-snapshot
Note on two-dimensional pattern matching by optimal parallel algorithms
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_3openalex-snapshot
On a parallel-algorithms method for string matching problems (overview)
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_17openalex-snapshot
Dictionary-matching on unbounded alphabets: Uniform length dictionaries
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_21openalex-snapshot
Approximate string matching with don't care characters
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_69openalex-snapshot
Optimal parallel algorithms for Prefix Matching
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_37openalex-snapshot
Multi-dimensional pattern matching with dimensional wildcards
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_51openalex-snapshot
String matching in hypertext
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_67openalex-snapshot
On the construction of classes of suffix trees for square matrices: Algorithms and applications
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_11openalex-snapshot
Perfect hashing for strings: Formalization and algorithms
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_158openalex-snapshot
Optimal logarithmic time randomized suffix tree construction
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_102openalex-snapshot
A simple parallel dictionary matching algorithm
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_61openalex-snapshot
On the Parallel Dynamic Dictionary Matching problem: New results with applications
inferred← citeshttps://doi.org/10.1007/3-540-63220-4_53openalex-snapshot
External inverse pattern matching
inferred← citeshttps://doi.org/10.1007/3-540-63220-4_54openalex-snapshot
Distributed generation of suffix arrays
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_17openalex-snapshot
On-line construction of two-dimensional suffix trees
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_1openalex-snapshot
Fast Parallel and Serial Multidimensional Approximate Array Matching
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_10openalex-snapshot
Parallel string matching algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_16openalex-snapshot
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-09076-9_33openalex-snapshot
Finding Optimal Paths of All Lengths in Directed Grid Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_28openalex-snapshot
Parallel External Memory Suffix Sorting
inferred← citeshttps://doi.org/10.1007/978-3-540-39763-2_11openalex-snapshot
A Combinatorial Approach to Automatic Discovery of Cluster-Patterns
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_18openalex-snapshot
Indexing a Dictionary for Subset Matching Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_1openalex-snapshot
Forty Years of Text Indexing
inferred← citeshttps://doi.org/10.1007/bf01185433openalex-snapshot
Pattern matching in a digitized image
inferred← citeshttps://doi.org/10.1007/bf01191471openalex-snapshot
Fast parallel Lyndon factorization with applications
inferred← citeshttps://doi.org/10.1007/bf01758848openalex-snapshot
Optimal parallel detection of squares in strings
inferred← citeshttps://doi.org/10.1007/bfb0029611openalex-snapshot
Parallel construction of minimal suffix and factor automata
inferred← citeshttps://doi.org/10.1007/bfb0029792openalex-snapshot
A linear time pattern matching algorithm between a string and a tree
inferred← citeshttps://doi.org/10.1007/bfb0032070openalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1007/bfb0037425openalex-snapshot
Efficient tree pattern unification
inferred← citeshttps://doi.org/10.1007/bfb0040379openalex-snapshot
On finding lowest common ancestors: Simplification and parallelization
inferred← citeshttps://doi.org/10.1007/bfb0049434openalex-snapshot
Incremental text editing: a new data structure
inferred← citeshttps://doi.org/10.1007/pl00008259openalex-snapshot
String Search in Coarse-Grained Parallel Computers
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90060-bopenalex-snapshot
Parallel construction of minimal suffix and factor automata
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90223-5openalex-snapshot
Efficient parallel algorithms to test square-freeness and factorize strings
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90176-vopenalex-snapshot
An efficient algorithm for the All Pairs Suffix-Prefix Problem
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90132-sopenalex-snapshot
On similarity of polynomial configurations
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00111-oopenalex-snapshot
Approximate string matching with don't care characters
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00003-8openalex-snapshot
A comparison of imperative and purely functional suffix tree constructions
inferred← citeshttps://doi.org/10.1016/0167-9260(92)90005-jopenalex-snapshot
A fast VLSI solution for approximate string matching
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90010-2openalex-snapshot
Fast parallel and serial approximate string matching
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90011-3openalex-snapshot
Fast algorithms for the unit cost editing distance between trees
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90034-vopenalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90003-uopenalex-snapshot
Efficient pattern matching with scaling
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90073-bopenalex-snapshot
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90318-vopenalex-snapshot
Fast parallel and serial multidimensional approximate array matching
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90137-5openalex-snapshot
Optimal algorithms for computing the canonical form of a circular string
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90197-2openalex-snapshot
Efficient CRCW-PRAM algorithms for universal substring searching
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00012-3openalex-snapshot
On two-dimensional pattern matching by optimal parallel algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00263-0openalex-snapshot
Sorting strings and constructing digital search trees in parallel
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90030-2openalex-snapshot
An efficient parallel algorithm for the single function coarsest partition problem
inferred← citeshttps://doi.org/10.1016/0885-064x(88)90008-8openalex-snapshot
Data structures and algorithms for approximate string matching
inferred← citeshttps://doi.org/10.1016/j.is.2021.101893openalex-snapshot
Full-text search engine with suffix index for massive heterogeneous data
inferred← citeshttps://doi.org/10.1016/j.parco.2014.06.007openalex-snapshot
Distributed text search using suffix arrays
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.036openalex-snapshot
A quick tour on suffix arrays and compressed suffix arrays
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.014openalex-snapshot
Counter based suffix tree for DNA pattern repeats
inferred← citeshttps://doi.org/10.1016/s0020-0190(96)00182-2openalex-snapshot
Optimal parallel randomized renaming
inferred← citeshttps://doi.org/10.1016/s0020-0255(01)00100-1openalex-snapshot
Parallelism and dictionary based data compression
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00035-2openalex-snapshot
Efficient text fingerprinting via Parikh mapping
inferred← citeshttps://doi.org/10.1089/cmb.2004.11.1050openalex-snapshot
Permutation Pattern Discovery in Biosequences
inferred← citeshttps://doi.org/10.1089/cmb.2012.0256openalex-snapshot
Parallel Continuous Flow: A Parallel Suffix Tree Construction Tool for Whole Genomes
inferred← citeshttps://doi.org/10.1093/comjnl/45.2.213openalex-snapshot
Exact Analyses of a Simple Heuristic Employed in Array Compression
inferred← citeshttps://doi.org/10.1109/dcc.1994.305921openalex-snapshot
Parsing algorithms for dictionary compression on the PRAM
inferred← citeshttps://doi.org/10.1109/icassp.2002.5743876openalex-snapshot
Automatic new word extraction method
inferred← citeshttps://doi.org/10.1109/iccsn.2011.6014022openalex-snapshot
A new parallel suffix tree construction algorithm
inferred← citeshttps://doi.org/10.1109/icpp.2002.1040889openalex-snapshot
Space and time efficient parallel algorithms and software for EST clustering
inferred← citeshttps://doi.org/10.1109/ipdps.2017.62openalex-snapshot
Parallel Construction of Suffix Trees and the All-Nearest-Smaller-Values Problem
inferred← citeshttps://doi.org/10.1109/ipps.1994.288274openalex-snapshot
Can parallel algorithms enhance serial implementation?
inferred← citeshttps://doi.org/10.1109/ipps.1994.288278openalex-snapshot
Sorting strings and constructing digital search trees in parallel
inferred← citeshttps://doi.org/10.1109/ipps.1994.288279openalex-snapshot
PRAM algorithms for static dictionary compression
inferred← citeshttps://doi.org/10.1109/ispan.1997.645099openalex-snapshot
RMESH algorithms for parallel string matching
inferred← citeshttps://doi.org/10.1109/sarnof.2007.4567340openalex-snapshot
New directions in covert malware modeling which exploit white-listing
inferred← citeshttps://doi.org/10.1109/sequen.1997.666919openalex-snapshot
Multi-string search in BSP
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63475openalex-snapshot
Efficient tree pattern matching
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63478openalex-snapshot
Recursive *-tree parallel data-structure
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185445openalex-snapshot
Adaptive dictionary matching
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548491openalex-snapshot
Efficient approximate and dynamic matching of patterns using a labeling paradigm
inferred← citeshttps://doi.org/10.1109/spire.1999.796583openalex-snapshot
A fast distributed suffix array generation algorithm
inferred← citeshttps://doi.org/10.1109/time-e.2013.6611980openalex-snapshot
Common substring in multiple sequences using hash based technique
inferred← citeshttps://doi.org/10.1109/tpds.2003.1255634openalex-snapshot
Space and time efficient parallel algorithms and software for EST clustering
inferred← citeshttps://doi.org/10.1137/0217079openalex-snapshot
On Finding Lowest Common Ancestors: Simplification and Parallelization
inferred← citeshttps://doi.org/10.1137/0221050openalex-snapshot
A Lower Bound for Parallel String Matching
inferred← citeshttps://doi.org/10.1137/0222017openalex-snapshot
Recursive Star-Tree Parallel Data Structure
inferred← citeshttps://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferred← citeshttps://doi.org/10.1137/1.9781611972917.5openalex-snapshot
A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction
inferred← citeshttps://doi.org/10.1137/s0097539702402354openalex-snapshot
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
inferred← citeshttps://doi.org/10.1137/s0097539792190157openalex-snapshot
Parallel Suffix–Prefix-Matching Algorithm and Applications
inferred← citeshttps://doi.org/10.1137/s0097539794291580openalex-snapshot
Simple Fast Parallel Hashing by Oblivious Execution
inferred← citeshttps://doi.org/10.1137/s0097539795298321openalex-snapshot
Two-Dimensional Periodicity in Rectangular Arrays
inferred← citeshttps://doi.org/10.1142/s0129626400000305openalex-snapshot
A HYPERCUBE ALGORITHM FOR SLIDING WINDOW COMPRESSION
inferred← citeshttps://doi.org/10.1142/s0129626496000054openalex-snapshot
OPTIMAL PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA
inferred← citeshttps://doi.org/10.1145/103418.103465openalex-snapshot
A lower bound for parallel string matching
inferred← citeshttps://doi.org/10.1145/1162666.1162676openalex-snapshot
Polymorphic worm detection and defense
inferred← citeshttps://doi.org/10.1145/165231.165239openalex-snapshot
Highly efficient dictionary matching in parallel
inferred← citeshttps://doi.org/10.1145/165231.165243openalex-snapshot
Parallel construction and query of suffix trees for two-dimensional matrices
inferred← citeshttps://doi.org/10.1145/165231.165261openalex-snapshot
An efficient parallel algorithm for the single function coarsest partition problem
inferred← citeshttps://doi.org/10.1145/1654059.1654122openalex-snapshot
Indexing genomic sequences on the IBM Blue Gene
inferred← citeshttps://doi.org/10.1145/1862919.1862922openalex-snapshot
I/O efficient algorithms for serial and parallel suffix tree construction
inferred← citeshttps://doi.org/10.1145/195058.195162openalex-snapshot
Optimal parallel suffix tree construction
inferred← citeshttps://doi.org/10.1145/195058.195164openalex-snapshot
Symmetry breaking for suffix tree construction
inferred← citeshttps://doi.org/10.1145/2488551.2488579openalex-snapshot
Efficient parallel construction of suffix trees for genomes larger than main memory
inferred← citeshttps://doi.org/10.1145/258492.258498openalex-snapshot
Three-dimensional pattern matching
inferred← citeshttps://doi.org/10.1145/2661653openalex-snapshot
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018791openalex-snapshot
Internally Deterministic Parallelism: Techniques and Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018792openalex-snapshot
Deterministic Parallelism in Sequential Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018793openalex-snapshot
A Deterministic Phase-Concurrent Parallel Hash Table
inferred← citeshttps://doi.org/10.1145/3018787.3018794openalex-snapshot
Priority Updates: A Contention-Reducing Primitive for Deterministic Programming
inferred← citeshttps://doi.org/10.1145/3018787.3018795openalex-snapshot
Ligra: A Lightweight Graph Processing Framework for Shared Memory
inferred← citeshttps://doi.org/10.1145/3018787.3018796openalex-snapshot
Ligra+: Adding Compression to Ligra
inferred← citeshttps://doi.org/10.1145/3018787.3018797openalex-snapshot
Linear-Work Parallel Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3018787.3018798openalex-snapshot
Parallel and Cache-Oblivious Triangle Computations
inferred← citeshttps://doi.org/10.1145/3018787.3018799openalex-snapshot
Parallel Cartesian Tree and Suffix Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018800openalex-snapshot
Parallel Computation of Longest Common Prefixes
inferred← citeshttps://doi.org/10.1145/3018787.3018801openalex-snapshot
Parallel Lempel-Ziv Factorization
inferred← citeshttps://doi.org/10.1145/3018787.3018802openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1145/3295500.3356211openalex-snapshot
Distributed enhanced suffix arrays
inferred← citeshttps://doi.org/10.1145/335305.335351openalex-snapshot
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
inferred← citeshttps://doi.org/10.1145/72935.72977openalex-snapshot
Optimal parallel suffix-prefix matching algorithm and applications
inferred← citeshttps://doi.org/10.1145/967900.967932openalex-snapshot
A parallel algorithm for the extraction of structured motifs
inferred← citeshttps://doi.org/10.1201/9781420011296.ch30openalex-snapshot
Parallel Algorithms on Strings
inferred← citeshttps://doi.org/10.1201/9781420036275-23openalex-snapshot
Expressed Sequence Tags: Clustering and Applications
inferred← citeshttps://doi.org/10.1201/9781420036275-24openalex-snapshot
Algorithms for Large-Scale Clustering and Assembly of Biological Sequence Data
inferred← citeshttps://doi.org/10.14257/ijgdc.2017.10.1.02openalex-snapshot
Alphabet-dependent Parallel Algorithm for Suffix Tree Construction for Pattern Searching
inferred← citeshttps://doi.org/10.3745/kipsta.2009.16a.5.319openalex-snapshot
Constant Time RMESH Algorithm for Computing Longest Common Substring and Maximal Repeat of String
inferred← citeshttps://doi.org/10.5445/ir/1000085031openalex-snapshot
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
inferred← citeshttps://doi.org/10.5555/314464.314633openalex-snapshot
The subtree max gap problem with application to parallel string covering
inferred← citeshttps://doi.org/10.5555/320176.320218openalex-snapshot
Suffix arrays: a new method for on-line string searches
inferred← citeshttps://doi.org/10.5555/320176.320220openalex-snapshot
Efficient pattern matching with scaling
inferred← citeshttps://doi.org/10.70675/09332216zaed7z4b67zb035zc6010a703c16openalex-snapshot
ASGART-fast & efficient de novo mapping of segmental duplications at the genome scale
inferred← citeshttps://doi.org/10.7146/brics.v2i16.19884openalex-snapshot
Optimal Parallel Construction of Minimal Suffix and Factor Automata
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.