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

1 broad error distribution and high-error-rate subsequences.

2 ofiling method to identify F(420)-correlated subsequences.

3 rocedure is designed to select optimal image subsequences.

4 ence in these regions for intermediate sized subsequences.

5 ded to reveal groups of conserved functional subsequences.

6 ce into all of its possible contiguous 25 nt subsequences.

7 short fixed- or variable-length high-scoring subsequences.

8 s that are composed of repeated and shuffled subsequences.

9 reads into the most frequent variable-length subsequences.

10 omizable in how it views and exports genomic subsequences.

11 rather than any structural similarity in the subsequences.

12 e example of one sequence segmented into two subsequences.

13 sking repetitive elements and low complexity subsequences.

14 and characterized a small 10-amino acid CAV subsequence (90-99) that accounted for the majority of e

15 ur operations, defines exactly the reference subsequence affected by the variant, even in repeat regi

16 For a given sequence, we usually use smaller subsequences (anchors) to find possible candidate positi

17 e build, genomic copy number of the 3 nested subsequence and influence of polymorphisms including a p

18 run, by defining k orders over all length-k subsequences and finding the optimal subsequence under e

19 he Large Language Model framework to analyze subsequences and global sequences comprehensively, which

20 each DNA sequence into multiple overlapping subsequences and models each subsequence separately, the

21 tedly selecting the highest scoring pairs of subsequences and using them to construct small portions

22 on, concatenation, and recycling of specific subsequences; and (iii) enabling the biologically plausi

23 gned to find matches when query and database subsequences are highly similar.

24 Extended subsequences are then post-processed to refine repeats t

25 GBA finds short subsequences as LCR candidates by traversing this graph.

26 Within a defined subsequence, base composition and homodimerization value

27 We propose an alignment- and reference- free subsequence based 16S rRNA data analysis, as a new parad

28 SubseqHash, a novel subsequence-based seeding method we recently developed,

29 , we clear the path for the wide adoption of subsequence-based seeds in long-read analysis.

30 the most likely region of the genome that a subsequence belongs to given the distribution of the sub

31 this model, the determination of non-called subsequences between any gene and its nearest neighbors

32 presentation of position-specific nucleotide subsequences, both within and adjacent to the aligned re

33 quence having the fewest mismatches with the subsequence, but that did not match the subsequence exac

34 imilar correlations both for small and large subsequences, but there is a difference in these regions

35 end' approach, in which occurrences of short subsequences called 'seeds' are used to search for poten

36 Protein subsequences can be Basic Local Alignment Search Tool (B

37 ved from global alignment of locally-aligned subsequences compared to global alignment of the full-le

38 tes due to the presence of errors within the subsequence containing the oligo tag intended to define

39 sults obtained from analyses with homologous subsequence detection programs.

40 includes the ability to extract features and subsequences, display sequences and features graphically

41 synthetically prepared DNA and RNA oligomer subsequences: DNA, 5'd-T-T-T-T-T-T-A-A-T-A-A-T-T-A-A-A-A

42 Most methods trim high-error-rate subsequences during error correction, which reduces both

43 e homologs) and local homologies (homologous subsequences embedded in nonhomologous sequence).

44 asured and the fluctuation spectrum of local subsequence entropies calculated to quantify the degree

45 the subsequence, but that did not match the subsequence exactly.

46 ree Markov models of order k associated with subsequences extracted from a given genome.

47 or scrolling full sequences or user-dictated subsequences for comparative viewing for organisms of in

48 udy, we developed a novel method to identify subsequences for detection of a given species/subspecies

49 sing paired KH-domains defined the preferred subsequences for each KH domain.

50 We may create pairs ("position", "subsequence") for the reference sequence and keep all su

51 pture of the continental lithosphere and the subsequence formation of sedimentary basins.

52 sualize the resulting ABA graphs and extract subsequences from ABA graphs.

53 oblem of recovering genes (and other genomic subsequences) from all individuals within a complex comm

54 oblem of recovering genes (and other genomic subsequences) from all individuals within a complex comm

55 enumeration is impractical as the number of subsequences grows exponentially.

56 Biological insight on subsequences important for classification can be achieve

57 nce belongs to given the distribution of the subsequence in the unmapped reads and phasings of famili

58 nnection between the intrinsic complexity of subsequences in a genome and the intrinsic, i.e. DNA enc

59 ility can be accurately predicted from short subsequences in each example.

60 tterns and then identifying over-represented subsequences in the promoter regions of those genes.

61 e-Morse (TM) sequence to remediate patterned subsequences in the schedule.

62 lly, complete domains are aligned to protein subsequences, in a 'semi-global alignment'.

63 It consists of symbols representing DNA subsequences, including regulatory elements and DNA asse

64 alignment, which aligns pieces of domains to subsequences, is common in high-throughput annotation ap

65 rying DNA sequences from pre-synthesized DNA subsequences - known as motifs - from a library.

66 n successfully applied to the longest common subsequence (LCS) and edit-distance problems, producing

67 he basic idea is to apply the longest common subsequence (LCS) framework to selected pairs of rows in

68 computational algorithm, Longest Increasing Subsequence (LIS) algorithm.

69 ction of specialized data sets and iterative subsequence masking.

70 We formulated the task of motif mapping as a subsequence matching problem and solved it using dynamic

71 TPepRet, an innovative model that integrates subsequence mining with semantic integration capabilitie

72 us or not can be answered by whether the two-subsequence model describes the DNA sequence better than

73 ng-signal was modeled by the distribution of subsequence occurrences (implicit motifs) using self-org

74 of oligomers, where each oligomer contains a subsequence of a circular genome, such that the oligomer

75 Finding the smallest subsequence of a string by enumeration is impractical as

76 A subsequence of CARC1 promotes cohesin binding to neighbo

77 sh maps a string of length n to its smallest subsequence of length k, k < n, according to a given ord

78 detected point mutations in a 198 base-pair subsequence of the Escherichia coli rpoB gene.

79 hemes select a minimum k-mer in every L-long subsequence of the target sequence, where minimality is

80 of AMI profiles are conserved, even in short subsequences of a species' genome, rendering a pervasive

81 ue array of DNA probes directed against rRNA subsequences of bacteria and fungi for identification.

82 Subsequences of Colias introns match subsequences of oth

83 of the presence/absence of short nucleotide subsequences of different length ('n-mers', n = 5-20) in

84 This paper revisits the question for subsequences of DNA taken at random from the genome.

85 s (e.g., raw reads or genomes) into a set of subsequences of length k, called k-mers, and then analyz

86 ogram to compare the frequencies of k-length subsequences of nucleotides with the frequencies predict

87 Subsequences of Colias introns match subsequences of other introns, untranslated regions of c

88 ing the PESS feature space over fixed-length subsequences of query peptides, and applying a sequentia

89 ighly perseverative and highly unpredictable subsequences of responses within a test session.

90 records, detailed by gene calls demarcating subsequences of the chromosomes.

91 chored placements to cluster the mappings of subsequences of unanchored ends to identify the size, co

92 e favored than others among fragments (i.e., subsequences) of sequences that encode uniquely, and exa

93 ng an optimal partitioning of non-repetitive subsequences over a prescribed range of tile sizes, on a

94 In each graph, a vertex denotes a similar subsequence pair.

95 A similar analysis was applied to subsequence pairs found by the Smith-Waterman algorithm.

96 ificant short, statistically overrepresented subsequence patterns (motifs) in a set of sequences is a

97 nsemble that place the aggregation-prone tau subsequences, PHF6* and PHF6, in conformations that are

98 to transform the signature into the closest subsequence present in the background.

99 use known algorithms for the longest common subsequence problem as part of our map integration strat

100 We propose SubseqHash, a strategy that uses subsequences, rather than substrings, as seeds.

101 Subsequence regions can be selected based on diverse cri

102 am modules that enables precise selection of subsequence regions from records of the RefSeq human gen

103 rogram information about the base, helix, or subsequence selected by the user.

104 ple overlapping subsequences and models each subsequence separately, therefore implicitly takes into

105 for the noncontacted residues between these subsequences, showing that the contact points must be op

106 ds; filtration of reads containing undesired subsequences (such as parts of adapters and PCR primers

107 ferences in the second leg (C) of the repeat subsequence that arise in the first leg (B) because of d

108 strate the algorithm's potential to identify subsequences that are conserved to different degrees.

109 Edges denote pairs of subsequences that can be connected to form higher simila

110 ique sites in DNA sequences by searching for subsequences that closely match the PCR primers and have

111 e that the -12 region core contains specific subsequences that direct the diverse RNA polymerase inte

112 It then extends them to find longer subsequences that may contain full repeats with low comp

113 equence coverage increases with the sizes of subsequence tiles that are to be included in the design.

114 nthetic mini-genes, which include degenerate subsequences totaling over 100 M bases of variation.

115 and an algorithm that computes the minimized subsequence under an ABC order in polynomial time.

116 ength-k subsequences and finding the optimal subsequence under each of the k orders in a single dynam

117 For small subsequences - up to 1 kb - this correlation is weak but

118 pproach is employed to find the best matched subsequence using regional textures.

119 ipid droplet (LD) dynamics and the metabolic subsequences, we generated an adipose tissue-specific DR

120 For each of these 25 nt subsequences, we searched a recent human transcript mapp

121 ores generated from the best locally-aligned subsequence were significantly less effective than SSEAR

122 Golem A and B subsequences were only found in primates and squirrel.

123 e homologous to each other and retrieves the subsequences which are conserved between the two DNA seq

124 nded replay is composed of chains of shorter subsequences, which may reflect a strategy for the stora

125 troduces an adaptation of the Longest Common Subsequence with kmer matches (LCSk++) algorithm tailore

126 d of an alignment such as the longest common subsequence with kmer matches (LCSk++) exist but do not

127 We pinpointed long common protein subsequences with consistent molecular movement but vary

128 he goal is to find a set of mutually similar subsequences within a collection of input sequences.

129 th problem" and leads to inverted amino acid subsequences within a de novo reconstruction.

130 ization and information-theoretic content of subsequences within a genome are strongly correlated to

131 Conservation of DNA subsequences within amplification origins from the 12 re

132 oups of similar sequences and locally aligns subsequences within them.