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 *

110 related articles for article (PubMed ID: 35125579)

  • 1. Approximate Minimum Selection with Unreliable Comparisons.
    Leucci S; Liu CH
    Algorithmica; 2022; 84(1):60-84. PubMed ID: 35125579
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons.
    Goodrich MT
    Algorithmica; 2014 Mar; 68(4):835-858. PubMed ID: 24550575
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An algorithm for approximate tandem repeats.
    Landau GM; Schmidt JP; Sokol D
    J Comput Biol; 2001; 8(1):1-18. PubMed ID: 11339903
    [TBL] [Abstract][Full Text] [Related]  

  • 4. New algorithms for maximum disjoint paths based on tree-likeness.
    Fleszar K; Mnich M; Spoerhase J
    Math Program; 2018; 171(1):433-461. PubMed ID: 30956356
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Randomized approximate nearest neighbors algorithm.
    Jones PW; Osipov A; Rokhlin V
    Proc Natl Acad Sci U S A; 2011 Sep; 108(38):15679-86. PubMed ID: 21885738
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Population evolution on a multiplicative single-peak fitness landscape.
    Woodcock G; Higgs PG
    J Theor Biol; 1996 Mar; 179(1):61-73. PubMed ID: 8733432
    [TBL] [Abstract][Full Text] [Related]  

  • 7. New Tools and Connections for Exponential-Time Approximation.
    Bansal N; Chalermsook P; Laekhanukit B; Nanongkai D; Nederlof J
    Algorithmica; 2019; 81(10):3993-4009. PubMed ID: 31496549
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Running Max/Min Filters using 1+o(1) Comparisons per Sample.
    Yuan H; Atallah MJ
    IEEE Trans Pattern Anal Mach Intell; 2011 Dec; 33(12):2544-2548. PubMed ID: 21876226
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Encoding range minima and range top-2 queries.
    Davoodi P; Navarro G; Raman R; Rao SS
    Philos Trans A Math Phys Eng Sci; 2014 May; 372(2016):20130131. PubMed ID: 24751865
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Semidefinite bounds for nonbinary codes based on quadruples.
    Litjens B; Polak S; Schrijver A
    Des Codes Cryptogr; 2017; 84(1):87-100. PubMed ID: 31564769
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem.
    Thankachan SV; Apostolico A; Aluru S
    J Comput Biol; 2016 Jun; 23(6):472-82. PubMed ID: 27058840
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On the inference of large phylogenies with long branches: how long is too long?
    Mossel E; Roch S; Sly A
    Bull Math Biol; 2011 Jul; 73(7):1627-44. PubMed ID: 20931293
    [TBL] [Abstract][Full Text] [Related]  

  • 15. The k partition-distance problem.
    Chen YH
    J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Connectivity with Uncertainty Regions Given as Line Segments.
    Cabello S; Gajser D
    Algorithmica; 2024; 86(5):1512-1544. PubMed ID: 38650952
    [TBL] [Abstract][Full Text] [Related]  

  • 17. On pattern matching with
    Nicolae M; Rajasekaran S
    Inf Process Lett; 2017 Feb; 118():78-82. PubMed ID: 28630523
    [TBL] [Abstract][Full Text] [Related]  

  • 18. No-Dimensional Tverberg Theorems and Algorithms.
    Choudhary A; Mulzer W
    Discrete Comput Geom; 2022; 68(4):964-996. PubMed ID: 36466127
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Computing Classical-Quantum Channel Capacity Using Blahut-Arimoto Type Algorithm: A Theoretical and Numerical Analysis.
    Li H; Cai N
    Entropy (Basel); 2020 Feb; 22(2):. PubMed ID: 33285996
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Sorting circular permutations by bounded transpositions.
    Feng X; Chitturi B; Sudborough H
    Adv Exp Med Biol; 2010; 680():725-36. PubMed ID: 20865560
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.