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 *

102 related articles for article (PubMed ID: 35575710)

  • 1. Fast Algorithms for the Simplified Partial Digest Problem.
    Wang BF
    J Comput Biol; 2023 Jan; 30(1):41-51. PubMed ID: 35575710
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Simplified partial digest problem: enumerative and dynamic programming algorithms.
    Blazewicz J; Burke E; Kasprzak M; Kovalev A; Kovalyov M
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):668-80. PubMed ID: 17975277
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A fast exact sequential algorithm for the partial digest problem.
    Abbas MM; Bahig HM
    BMC Bioinformatics; 2016 Dec; 17(Suppl 19):510. PubMed ID: 28155644
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Genetic algorithm solution for partial digest problem.
    Ahrabian H; Ganjtabesh M; Nowzari-Dalini A; Razaghi-Moghadam-Kashani Z
    Int J Bioinform Res Appl; 2013; 9(6):584-94. PubMed ID: 24084239
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An Algorithm for Gene Fragment Reconstruction.
    Fang N; Wang K; Tong D
    Interdiscip Sci; 2021 Mar; 13(1):118-127. PubMed ID: 33609237
    [TBL] [Abstract][Full Text] [Related]  

  • 6. The double digest problem: finding all solutions.
    Sur-Kolay S; Banerjee S; Mukhopadhyaya S; Murthy CA
    Int J Bioinform Res Appl; 2009; 5(5):570-92. PubMed ID: 19778871
    [TBL] [Abstract][Full Text] [Related]  

  • 7. An Omega(n2/ log n) speed-up of TBR heuristics for the gene-duplication problem.
    Bansal MS; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(4):514-24. PubMed ID: 18989039
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Improved algorithms for searching restriction maps.
    Miller W; Barr J; Rudd KE
    Comput Appl Biosci; 1991 Oct; 7(4):447-56. PubMed ID: 1747775
    [TBL] [Abstract][Full Text] [Related]  

  • 9. The median problems on linear multichromosomal genomes: graph representation and fast exact solutions.
    Xu AW
    J Comput Biol; 2010 Sep; 17(9):1195-211. PubMed ID: 20874404
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A partial digest approach to restriction site mapping.
    Skiena SS; Sundaram G
    Bull Math Biol; 1994 Mar; 56(2):275-94. PubMed ID: 8186755
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance.
    Wei Z; Zhu D; Wang L
    J Comput Biol; 2015 Jul; 22(7):666-76. PubMed ID: 26161597
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Genetic algorithm solution for double digest problem.
    Ganjtabesh M; Ahrabian H; Nowzari-Dalini A; Kashani Moghadam ZR
    Bioinformation; 2012; 8(10):453-6. PubMed ID: 22715298
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An exponential example for a partial digest mapping algorithm.
    Zhang Z
    J Comput Biol; 1994; 1(3):235-9. PubMed ID: 8790468
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An O (N2 log N) restriction map comparison and search algorithm.
    Myers EW; Huang X
    Bull Math Biol; 1992 Jul; 54(4):599-618. PubMed ID: 1591534
    [TBL] [Abstract][Full Text] [Related]  

  • 15. The solution space of sorting by DCJ.
    Braga MD; Stoye J
    J Comput Biol; 2010 Sep; 17(9):1145-65. PubMed ID: 20874401
    [TBL] [Abstract][Full Text] [Related]  

  • 16. An efficient Earth Mover's Distance algorithm for robust histogram comparison.
    Ling H; Okada K
    IEEE Trans Pattern Anal Mach Intell; 2007 May; 29(5):840-53. PubMed ID: 17356203
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings.
    Allen DR; Thankachan SV; Xu B
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):138-148. PubMed ID: 31985439
    [TBL] [Abstract][Full Text] [Related]  

  • 18. The chimeric mapping problem: algorithmic strategies and performance evaluation on synthetic genomic data.
    Greenberg D; Istrail S
    Comput Chem; 1994 Sep; 18(3):207-20. PubMed ID: 7952891
    [TBL] [Abstract][Full Text] [Related]  

  • 19. RecMotif: a novel fast algorithm for weak motif discovery.
    Sun HQ; Low MY; Hsu WJ; Rajapakse JC
    BMC Bioinformatics; 2010 Dec; 11 Suppl 11(Suppl 11):S8. PubMed ID: 21172058
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Multidimensional scaling for large genomic data sets.
    Tzeng J; Lu HH; Li WH
    BMC Bioinformatics; 2008 Apr; 9():179. PubMed ID: 18394154
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.