Keywords: آرایه سوفی; Suffix tree; Suffix array; Weighted ancestor query; Compressed suffix array; Succinct encoding;
مقالات ISI آرایه سوفی (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: آرایه سوفی; Data structures; Suffix array; LCP array; Document array; String collections;
Keywords: آرایه سوفی; Suffix-prefix matching; Suffix array; LCP array;
Keywords: آرایه سوفی; Data structures; Suffix array; Burrows-Wheeler transform; String algorithms;
Identifying components of mixed and contaminated soil samples by detecting specific signatures of control 16S rRNA libraries
Keywords: آرایه سوفی; Soil signature; 16S rRNA; Suffix array; Source identification; Contaminated soil; Mixed samples;
xkcd-repeats: A new taxonomy of repeats defined by their context diversity
Keywords: آرایه سوفی; Repeats; Stringology; Text algorithms; Suffix array; Natural-language processing;
A survey of string orderings and their application to the Burrows-Wheeler transform
Keywords: آرایه سوفی; Algorithm; Bijective; Binary alphabet; Block order; Burrows-Wheeler transform; B-word; Data clustering; Degenerate; GB-word; Generic alphabet; Generic block order; Indeterminate Lyndon word; Inverse transform; Lexicographic order; Linear; Lyndon word; S
Optimal suffix sorting and LCP array construction for constant alphabets
Keywords: آرایه سوفی; Data structures; Suffix array; LCP array; Linear time; Constant space;
Parallel lightweight wavelet tree, suffix array and FM-index construction
Keywords: آرایه سوفی; Wavelet tree; Suffix array; FM index; Parallel; Induced sorting; Lightweight;
Tighter bounds for the sum of irreducible LCP values
Keywords: آرایه سوفی; LCP array; Irreducible LCP values; Suffix array; Burrows-Wheeler transform;
Binary block order Rouen Transform
Keywords: آرایه سوفی; Algorithm; Bijective; Binary alphabet; Block order; Burrows-Wheeler Transform; B-word; Data clustering; Inverse transform; Lexicographic order; Linear; Lyndon word; String; Suffix array; Suffix-sorting; Word;
Suffix array and Lyndon factorization of a text
Keywords: آرایه سوفی; Sorting suffixes; BWT; Suffix array; Lyndon word; Lyndon factorization
A bijective variant of the Burrows–Wheeler Transform using V-order
Keywords: آرایه سوفی; Algorithm; Bijective; Burrows–Wheeler Transform; Complexity; Lexicographic order; Lex-extension order; Linear; Lyndon word; String; Suffix array; Total order; V-BWT; V-order; V-transform; V-word; Word
On the combinatorics of suffix arrays
Keywords: آرایه سوفی; Combinatorial problems; Permutations; Suffix array; Burrows–Wheeler transform
Efficient algorithms for three variants of the LPF table
Keywords: آرایه سوفی; Longest previous reverse factor; Longest previous non-overlapping reverse factor; Longest previous non-overlapping factor; Longest previous factor; Palindrome; Runs; Suffix array; Text compression
Indeterminate string inference algorithms
Keywords: آرایه سوفی; Indeterminate string inference; Border array; Suffix array; LCP array
On the number of elements to reorder when updating a suffix array
Keywords: آرایه سوفی; FM-index; Burrows–Wheeler Transform; Suffix array; Longest common prefix; Dynamic data structure; Self-index; Complexity
Computing Longest Previous non-overlapping Factors
Keywords: آرایه سوفی; Design of algorithms; Longest previous factor; Suffix array; Ziv–Lempel factorisation; Text compression; Detection of repetitions
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
Keywords: آرایه سوفی; Algorithms; Suffix array; Suffix-prefix matching;
Dynamic extended suffix arrays
Keywords: آرایه سوفی; Dynamic; Suffix array; Edit operations; Algorithm design; Self-index data structures; FM-index
Text indexing with errors
Keywords: آرایه سوفی; Text indexing; Edit distance; Levenshtein distance; Suffix tree; Suffix array; Trie; PATRICIA tree; Average-case
Space efficient linear time construction of suffix arrays
Keywords: آرایه سوفی; Computational biology; Pattern matching; String algorithms; Suffix array; Suffix sorting;