User: Tianyang Li

gravatar for Tianyang Li
Tianyang Li490
Reputation:
490
Status:
New User
Location:
Beijing, China
Website:
http://li-tianyang.com
Last seen:
5 years, 8 months ago
Joined:
7 years, 1 month ago
Email:
t*@li-tianyang.com

Posts by Tianyang Li

<prev • 74 results • page 1 of 8 • next >
2
votes
1
answer
1.2k
views
1
answer
Repetitive Sequence Patterns Within A Gene Locus
... Hi, I have a question about repetitive sequence patterns within a gene locus. How long does a sequence pattern have to be for it to be almost unique within a gene locus? Thanks! ...
gene repeats sequence written 6.1 years ago by Tianyang Li490 • updated 6.1 years ago by Istvan Albert ♦♦ 77k
0
votes
2
answers
3.9k
views
2
answers
Comment: C: Tools For Visualizing Rna-Seq Splicing Graphs From De Novo Assembly Without A Re
... I've looked at this paper but it seems it's too complicated to set up and its functionality is a bit lacking. ...
written 6.1 years ago by Tianyang Li490
6
votes
2
answers
3.9k
views
2
answers
Tools For Visualizing Rna-Seq Splicing Graphs From De Novo Assembly Without A Reference Genome?
... Hi Are there existing tools for visualizing RNA-Seq splicing graphs from de novo assembly without a reference genome? What I'd like is something that can show how read goes from one exon to another and the coverage of each exon. Are there such tools using only contigs assembled by a de novo assem ...
assembly splicing rna-seq graph written 6.1 years ago by Tianyang Li490 • updated 2.7 years ago by guillaume.gautreau44140
1
vote
1
answer
1.9k
views
1
answer
Existing Tools For Post-Processing After Aligning Paired-End Reads With Blat?
... Hi, I'm wondering if there are existing tools that can do post-processing on paired-end reads' BLAT output. More specifically, I'd like the tool to "merge" the alignments from the alignments of each pair's ends and remove the inconsistent alignments while keeping the consistent ones. The tool shou ...
paired-end blat written 6.1 years ago by Tianyang Li490 • updated 6.1 years ago by Damian Kao15k
1
vote
2
answers
2.9k
views
2
answers
Answer: A: Thread Safe C/C++ Libraries For Sequence Alignment
... Seqan's alignment's OK for multi-threading. Here's what one of the authors said. ...
written 6.2 years ago by Tianyang Li490
4
votes
2
answers
2.9k
views
2
answers
Thread Safe C/C++ Libraries For Sequence Alignment
... Hi, Are there thread safe C/C++ library for sequence alignment? I was checking out Seqan, but in the documentation it wasn't explicitly stated that it's thread safe for alignments. I'm wondering if there are other libraries available? Thanks! ...
alignment C library written 6.2 years ago by Tianyang Li490
0
votes
4
answers
2.0k
views
4
answers
Comment: C: Best Existing Tool For Computing The Overlaps Between Each Read In A Set Of Shor
... Do you think clustering the reads that weren't assembled into contigs because of errors during de novo assmebly is a good approach? I think the fact that those reads could be aligned to the contigs but not assembled into the contigs is a sign that using a kmer approach might fail. ...
written 6.2 years ago by Tianyang Li490
0
votes
4
answers
2.0k
views
4
answers
Comment: C: Best Existing Tool For Computing The Overlaps Between Each Read In A Set Of Shor
... I'm actually using assembly results from Trinity, but the contigs are a bit short and Trinity doesn't do scaffolding. ...
written 6.2 years ago by Tianyang Li490
0
votes
4
answers
2.0k
views
4
answers
Comment: C: Best Existing Tool For Computing The Overlaps Between Each Read In A Set Of Shor
... I'm actually trying to make the contigs from de novo assembler better. Assemblers such as Trinity produce contigs that are usually a bit shorter because of errors in reads. ...
written 6.2 years ago by Tianyang Li490
0
votes
4
answers
2.0k
views
4
answers
Comment: C: Best Existing Tool For Computing The Overlaps Between Each Read In A Set Of Shor
... I forgot to mention that I'm doing this de novo, so no reference genome is available. ...
written 6.2 years ago by Tianyang Li490

Latest awards to Tianyang Li

No awards yet. Soon to come :-)

Help
Access

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.
Powered by Biostar version 2.3.0
Traffic: 720 users visited in the last hour