ライフサイエンスコーパス: suffix

1 Streptococcus pneumoniae genomes for shared suffixes.

2 le online at: http://hto-c.usc.edu:8000/msms/suffix/.

3 omic distribution of disease extent, but the suffixes A or B for symptoms will only be included for H

4 nt an innovative algorithm, SA-SSR, based on suffix and longest common prefix arrays for efficiently

5 es, low frequency trigrams, indicator terms, suffixes and part-of-speech information.

6 The algorithm leverages a sparse suffix array (SA), a text index that stores every K-th p

7 computational efficiency is achieved using a suffix array data structure that allows for fast queryin

8 dentify alignment seeds, due to its use of a suffix array data structure.

9 Here a theory of haplotype matching using suffix array ideas is developed, which should scale too

10 We combined this pipeline with a Suffix Array Spliced Read (SASR) aligner to detect chime

11 s an efficient implementation of the partial suffix array to detect read overlaps with different seed

12 Here, we show how to use suffix array-based methods that have formed the basis of

13 e desirable features of the lookup table and suffix array.

14 utation of minimal absent words based on the suffix array.

15 maximum mappable seed search in uncompressed suffix arrays followed by seed clustering and stitching

16 ng for faster read overlap detection, sparse suffix arrays for creating smaller indexes, and Bloom fi

17 Due to their flexibility, suffix arrays have been the data structure of choice for

18 Over the last few years, methods based on suffix arrays using the Burrows-Wheeler Transform have b

19 ent transcriptome indexing based on modified suffix arrays, EMSAR minimizes the use of CPU time and m

20 length n on a fixed-sized alphabet based on suffix arrays.

21 he same problem based on the construction of suffix arrays.

22 ntegrated seed-and-extend framework based on suffix arrays.

23 al absent words based on the construction of suffix arrays; and second, we provide the respective imp

24 -sized alphabet based on the construction of suffix automata.

25 he last two bases of each window were read ('suffix' codons).

26 lly complex words (words made up of base and suffix, e.g., agree+able) typically reflects frequency o

27 nic ancestor, Modern English uses the dental suffix, '-ed', to signify past tense.

28 found overlaps between reads using a prefix/suffix hash table.

29 thm as long as the space between the indexed suffixes is not greater than a minimum length of a MEM.

30 eptide allows one to separate the prefix and suffix ladders, to greatly reduce the number of noise pe

31 rigin from the larger gastric bezoar and the suffix 'lets' conveys they are smaller in size.

32 e introduce suffix skips to traverse several suffix links simultaneously and use them to efficiently

33 eads, in order to find the longest prefix or suffix of the read that has a match in the target sequen

34 max)(x, y), is the longest string which is a suffix of x and a prefix of y.

35 in the UStags (i.e., the UStags' prefix and suffix sequences and the UStags themselves) were used to

36 We introduce suffix skips to traverse several suffix links simultaneo

37 We then search the suffix tree against the spectrum graph for candidate pep

38 parison with other techniques, probabilistic suffix tree and correlation mining techniques produce th

39 speaking, we employed an approach combining suffix tree data structure and spectrum graph.

40 We describe an algorithm, Suffix Tree EM for Motif Elicitation (STEME), that appro

41 A suffix tree is a data structure that can efficiently ind

42 The suffix tree is used to preprocess the protein sequence d

43 T or FASTA, while requiring less memory than suffix tree methods.

44 ts efficiency, Slicembler uses a generalized suffix tree to identify these frequent contigs (or fract

45 Using an efficient data structure called a suffix tree, the system is able to rapidly align sequenc

46 We describe a suffix-tree algorithm that can align the entire genome s

47 plore deep topological relationships between suffix trees and compressed de Bruijn graphs and introdu

48 knowledge, this is the first application of suffix trees to EM.

49 citation (STEME), that approximates EM using suffix trees.