These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
85 related articles for article (PubMed ID: 26120359)
61. An O(m log m)-Time Algorithm for Detecting Superbubbles. Sung WK; Sadakane K; Shibuya T; Belorkar A; Pyrogova I IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(4):770-7. PubMed ID: 26357315 [TBL] [Abstract][Full Text] [Related]
62. Splicing graphs and EST assembly problem. Heber S; Alekseyev M; Sze SH; Tang H; Pevzner PA Bioinformatics; 2002; 18 Suppl 1():S181-8. PubMed ID: 12169546 [TBL] [Abstract][Full Text] [Related]
63. On the limit cycle structure of threshold boolean networks over complete graphs. Voutsadakis G Int J Neural Syst; 2004 Jun; 14(3):209-15. PubMed ID: 15243953 [TBL] [Abstract][Full Text] [Related]
64. Exact enumeration approach to the directed polymer problem. Devillard P; Stanley HE Phys Rev A; 1990 Mar; 41(6):2942-2951. PubMed ID: 9903444 [No Abstract] [Full Text] [Related]
65. ASGAL: aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events. Denti L; Rizzi R; Beretta S; Vedova GD; Previtali M; Bonizzoni P BMC Bioinformatics; 2018 Nov; 19(1):444. PubMed ID: 30458725 [TBL] [Abstract][Full Text] [Related]
66. A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs. Sacomoto G; Lacroix V; Sagot MF Algorithms Mol Biol; 2015; 10():20. PubMed ID: 26120359 [TBL] [Abstract][Full Text] [Related]
67. Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads. Lima L; Sinaimeri B; Sacomoto G; Lopez-Maestre H; Marchet C; Miele V; Sagot MF; Lacroix V Algorithms Mol Biol; 2017; 12():2. PubMed ID: 28250805 [TBL] [Abstract][Full Text] [Related]
68. Enumerating treelike chemical graphs with given path frequency. Fujiwara H; Wang J; Zhao L; Nagamochi H; Akutsu T J Chem Inf Model; 2008 Jul; 48(7):1345-57. PubMed ID: 18588284 [TBL] [Abstract][Full Text] [Related]
69. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS. Kundeti V; Rajasekaran S; Dinh H Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472 [TBL] [Abstract][Full Text] [Related]
70. Read-Split-Run: an improved bioinformatics pipeline for identification of genome-wide non-canonical spliced regions using RNA-Seq data. Bai Y; Kinne J; Donham B; Jiang F; Ding L; Hassler JR; Kaufman RJ BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):503. PubMed ID: 27556805 [TBL] [Abstract][Full Text] [Related]
74. Oases: robust de novo RNA-seq assembly across the dynamic range of expression levels. Schulz MH; Zerbino DR; Vingron M; Birney E Bioinformatics; 2012 Apr; 28(8):1086-92. PubMed ID: 22368243 [TBL] [Abstract][Full Text] [Related]