You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
* The transcriptome (consisting of transcripts $t1,...,t6$) is converted into a \$ separated string "T"
155
+
* On "T" suffix array, SA[T], and a hash table, h , are constructed (in indexing step).
156
+
* The mapping operation begins with a k-mer (here, k = 3)
157
+
* From left to right, the read is scanned until a k-mer appears in the hash table.
158
+
* All suffixes containing the k-mer are found in the hash table and the SA intervals are retrieved
159
+
* The maximal matching prefix (MMP) is determined by finding the longest read sequence that exactly matches the reference suffix
160
+
* This process is repeated until the end of the read
161
+
* The final mapping is generated by determining the transcripts that appear in all MMPs for the read
162
+
163
+
</div>
164
+
165
+
\
166
+
167
+
Avi Srivastava *et al.* (2016) Bioinformatics 2016 Jun 15;32(12)
168
+
169
+
170
+
## Abundance estimation
171
+
172
+
* With the quasi-mapping method, the best mapping is determined for each read
173
+
* After modeling sample-specific parameters and biases, salmon will generate transcript abundance estimates
174
+
* A read that maps equally to more than one transcript will have its count divided among them (Isoform information not lost)
175
+
* A variety of complex modeling approaches are used to estimate transcript abundances, including Expectation Maximization (EM), which corrects for sample-specific biases.
176
+
* GC bias
177
+
* Positional bias
178
+
* Fragment length bias
179
+
* Sequence-based bias
180
+
181
+
122
182
## Practical
123
183
184
+
124
185
1. Create and index to the transcriptome with Salmon
0 commit comments