111 related articles for article (PubMed ID: 37871087)
21. Split and Merge Watershed: a two-step method for cell segmentation in fluorescence microscopy images.
Gamarra M; Zurek E; Escalante HJ; Hurtado L; San-Juan-Vergara H
Biomed Signal Process Control; 2019 Aug; 53():. PubMed ID: 33719364
[TBL] [Abstract][Full Text] [Related]
22. Temporal Merge Tree Maps: A Topology-Based Static Visualization for Temporal Scalar Data.
Kopp W; Weinkauf T
IEEE Trans Vis Comput Graph; 2023 Jan; 29(1):1157-1167. PubMed ID: 36155442
[TBL] [Abstract][Full Text] [Related]
23. Wasserstein Auto-Encoders of Merge Trees (and Persistence Diagrams).
Pont M; Tierny J
IEEE Trans Vis Comput Graph; 2023 Nov; PP():. PubMed ID: 38015696
[TBL] [Abstract][Full Text] [Related]
24. Algorithmic height compression of unordered trees.
Ben-Naoum F; Godin C
J Theor Biol; 2016 Jan; 389():237-52. PubMed ID: 26551155
[TBL] [Abstract][Full Text] [Related]
25. Parallel computation of 2D Morse-Smale complexes.
Shivashankar N; Senthilnathan M; Natarajan V
IEEE Trans Vis Comput Graph; 2012 Oct; 18(10):1757-70. PubMed ID: 22156106
[TBL] [Abstract][Full Text] [Related]
26. Unbiased pangenome graphs.
Garrison E; Guarracino A
Bioinformatics; 2023 Jan; 39(1):. PubMed ID: 36448683
[TBL] [Abstract][Full Text] [Related]
27. MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
Li D; Huang Y; Leung CM; Luo R; Ting HF; Lam TW
BMC Bioinformatics; 2017 Oct; 18(Suppl 12):408. PubMed ID: 29072142
[TBL] [Abstract][Full Text] [Related]
28. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
[TBL] [Abstract][Full Text] [Related]
29. MMap: Fast Billion-Scale Graph Computation on a PC via Memory Mapping.
Lin Z; Kahng M; Sabrin KM; Chau DH; Lee H; Kang U
Proc IEEE Int Conf Big Data; 2014 Oct; 2014():159-164. PubMed ID: 25866846
[TBL] [Abstract][Full Text] [Related]
30. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
Baste J; Paul C; Sau I; Scornavacca C
Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
[TBL] [Abstract][Full Text] [Related]
31. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
[TBL] [Abstract][Full Text] [Related]
32. Parallel clustering algorithm for large data sets with applications in bioinformatics.
Olman V; Mao F; Wu H; Xu Y
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):344-52. PubMed ID: 19407357
[TBL] [Abstract][Full Text] [Related]
33. MEGAHIT v1.0: A fast and scalable metagenome assembler driven by advanced methodologies and community practices.
Li D; Luo R; Liu CM; Leung CM; Ting HF; Sadakane K; Yamashita H; Lam TW
Methods; 2016 Jun; 102():3-11. PubMed ID: 27012178
[TBL] [Abstract][Full Text] [Related]
34. Towards Scalable Graph Computation on Mobile Devices.
Chen Y; Lin Z; Pienta R; Kahng M; Chau DH
Proc IEEE Int Conf Big Data; 2014 Oct; 2014():29-35. PubMed ID: 25859564
[TBL] [Abstract][Full Text] [Related]
35. Exact parallel maximum clique algorithm for general and protein graphs.
Depolli M; Konc J; Rozman K; Trobec R; Janežič D
J Chem Inf Model; 2013 Sep; 53(9):2217-28. PubMed ID: 23965016
[TBL] [Abstract][Full Text] [Related]
36. Output-Sensitive Construction of Reeb Graphs.
Doraiswamy H; Natarajan V
IEEE Trans Vis Comput Graph; 2012 Jan; 18(1):146-59. PubMed ID: 21301023
[TBL] [Abstract][Full Text] [Related]
37. Application of the extremum stack to neurological MRI.
Simmons A; Arridge SR; Tofts PS; Barker GJ
IEEE Trans Med Imaging; 1998 Jun; 17(3):371-82. PubMed ID: 9735901
[TBL] [Abstract][Full Text] [Related]
38. Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP.
Ketchaya S; Rattanatranurak A
Sci Rep; 2023 Apr; 13(1):6408. PubMed ID: 37076726
[TBL] [Abstract][Full Text] [Related]
39. A fast tool for minimum hybridization networks.
Chen ZZ; Wang L; Yamanaka S
BMC Bioinformatics; 2012 Jul; 13():155. PubMed ID: 22748099
[TBL] [Abstract][Full Text] [Related]
40. FastJoin, an improved neighbor-joining algorithm.
Wang J; Guo MZ; Xing LL
Genet Mol Res; 2012 Jul; 11(3):1909-22. PubMed ID: 22869546
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
