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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

121 related articles for article (PubMed ID: 36071384)

  • 1. A fast and efficient path elimination algorithm for large-scale multiple common longest sequence problems.
    Yu C; Lin P; Zhao Y; Ren T; Wang G
    BMC Bioinformatics; 2022 Sep; 23(1):366. PubMed ID: 36071384
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A path recorder algorithm for Multiple Longest Common Subsequences (MLCS) problems.
    Wei S; Wang Y; Yang Y; Liu S
    Bioinformatics; 2020 May; 36(10):3035-3042. PubMed ID: 32119070
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem.
    Peng Z; Wang Y
    Front Genet; 2017; 8():104. PubMed ID: 28848600
    [TBL] [Abstract][Full Text] [Related]  

  • 4. dwMLCS: An Efficient MLCS Algorithm based on Dynamic and Weighted Directed Acyclic Graph.
    Yu C; Gao D; Guo X; Ma H; Zhao Y; Wang G
    IEEE/ACM Trans Comput Biol Bioinform; 2024 Jul; PP():. PubMed ID: 39037883
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A fast and memory efficient MLCS algorithm by character merging for DNA sequences alignment.
    Liu S; Wang Y; Tong W; Wei S
    Bioinformatics; 2020 Feb; 36(4):1066-1073. PubMed ID: 31584616
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
    Yang J; Xu Y; Shang Y; Chen G
    IEEE Trans Knowl Data Eng; 2014 Nov; 26(11):2599-2609. PubMed ID: 25400485
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A new algorithm for "the LCS problem" with application in compressing genome resequencing data.
    Beal R; Afrin T; Farheen A; Adjeroh D
    BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):544. PubMed ID: 27556803
    [TBL] [Abstract][Full Text] [Related]  

  • 8. New Construction of Family of MLCS Algorithms.
    Shi H; Wang J
    J Healthc Eng; 2021; 2021():6636710. PubMed ID: 33542799
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Multiple genome alignment based on longest path in directed acyclic graphs.
    Ma F; Deogun JS
    Int J Bioinform Res Appl; 2010; 6(4):366-83. PubMed ID: 20940124
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.
    Caceres M; Mumey B; Husic E; Rizzi R; Cairo M; Sahlin K; Tomescu AI
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3673-3684. PubMed ID: 34847041
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A DAG scheduling scheme on heterogeneous computing systems using tuple-based chemical reaction optimization.
    Jiang Y; Shao Z; Guo Y
    ScientificWorldJournal; 2014; 2014():404375. PubMed ID: 25143977
    [TBL] [Abstract][Full Text] [Related]  

  • 12. 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]  

  • 13. Deposition and extension approach to find longest common subsequence for thousands of long sequences.
    Ning K
    Comput Biol Chem; 2010 Jun; 34(3):149-57. PubMed ID: 20570215
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Protein-fold recognition using an improved single-source K diverse shortest paths algorithm.
    Lhota J; Xie L
    Proteins; 2016 Apr; 84(4):467-72. PubMed ID: 26800480
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Path matching and graph matching in biological networks.
    Yang Q; Sze SH
    J Comput Biol; 2007; 14(1):56-67. PubMed ID: 17381346
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A fast parallel algorithm for finding the longest common sequence of multiple biosequences.
    Chen Y; Wan A; Liu W
    BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S4. PubMed ID: 17217522
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A tighter generalization bound for reservoir computing.
    Han X; Zhao Y; Small M
    Chaos; 2022 Apr; 32(4):043115. PubMed ID: 35489854
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Graph Matching with Adaptive and Branching Path Following.
    Wang T; Ling H; Lang C; Feng S
    IEEE Trans Pattern Anal Mach Intell; 2018 Dec; 40(12):2853-2867. PubMed ID: 29989966
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.
    Wang X; Wang L; Zhu D
    J Comput Biol; 2019 Sep; 26(9):938-947. PubMed ID: 30958704
    [No Abstract]   [Full Text] [Related]  

  • 20. A deep neural network based hierarchical multi-label classification method.
    Feng S; Zhao C; Fu P
    Rev Sci Instrum; 2020 Feb; 91(2):024103. PubMed ID: 32113459
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.