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 *

126 related articles for article (PubMed ID: 17456012)

  • 21. Reconstruction of protein structures from a vectorial representation.
    Porto M; Bastolla U; Roman HE; Vendruscolo M
    Phys Rev Lett; 2004 May; 92(21):218101. PubMed ID: 15245321
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Finding nested common intervals efficiently.
    Blin G; Faye D; Stoye J
    J Comput Biol; 2010 Sep; 17(9):1183-94. PubMed ID: 20874403
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A reduction-based exact algorithm for the contact map overlap problem.
    Xie W; Sahinidis NV
    J Comput Biol; 2007 Jun; 14(5):637-54. PubMed ID: 17683265
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A fast O(N) multiresolution polygonal approximation algorithm for GPS trajectory simplification.
    Chen M; Xu M; Fränti P
    IEEE Trans Image Process; 2012 May; 21(5):2770-85. PubMed ID: 22311861
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits.
    Kliuchnikov V; Maslov D; Mosca M
    Phys Rev Lett; 2013 May; 110(19):190502. PubMed ID: 23705696
    [TBL] [Abstract][Full Text] [Related]  

  • 26. A faster 1.375-approximation algorithm for sorting by transpositions.
    Cunha LF; Kowada LA; Hausen Rde A; de Figueiredo CM
    J Comput Biol; 2015 Nov; 22(11):1044-56. PubMed ID: 26383040
    [TBL] [Abstract][Full Text] [Related]  

  • 27. An O(n log n)-time algorithm for the restriction scaffold assignment problem.
    Colannino J; Damian M; Hurtado F; Iacono J; Meijer H; Ramaswami S; Toussaint G
    J Comput Biol; 2006 May; 13(4):979-89. PubMed ID: 16761922
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Maximum contact map overlap revisited.
    Andonov R; Malod-Dognin N; Yanev N
    J Comput Biol; 2011 Jan; 18(1):27-41. PubMed ID: 21210730
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Efficient extraction of mapping rules of atoms from enzymatic reaction data.
    Akutsu T
    J Comput Biol; 2004; 11(2-3):449-62. PubMed ID: 15285901
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Classification of ligand molecules in PDB with fast heuristic graph match algorithm COMPLIG.
    Saito M; Takemura N; Shirai T
    J Mol Biol; 2012 Dec; 424(5):379-90. PubMed ID: 23041414
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming.
    Imada T; Ota S; Nagamochi H; Akutsu T
    J Chem Inf Model; 2011 Nov; 51(11):2788-807. PubMed ID: 21848281
    [TBL] [Abstract][Full Text] [Related]  

  • 33. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Approximating subtree distances between phylogenies.
    Bonet ML; St John K; Mahindru R; Amenta N
    J Comput Biol; 2006 Oct; 13(8):1419-34. PubMed ID: 17061919
    [TBL] [Abstract][Full Text] [Related]  

  • 35. A contact map matching approach to protein structure similarity analysis.
    de Melo RC; Lopes CE; Fernandes FA; da Silveira CH; Santoro MM; Carceroni RL; Meira W; Araújo Ade A
    Genet Mol Res; 2006 Jun; 5(2):284-308. PubMed ID: 16819709
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Algorithms for optimal protein structure alignment.
    Poleksic A
    Bioinformatics; 2009 Nov; 25(21):2751-6. PubMed ID: 19734152
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Short superstrings and the structure of overlapping strings.
    Armen C; Stein C
    J Comput Biol; 1995; 2(2):307-32. PubMed ID: 7497131
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Maximum likelihood of evolutionary trees: hardness and approximation.
    Chor B; Tuller T
    Bioinformatics; 2005 Jun; 21 Suppl 1():i97-106. PubMed ID: 15961504
    [TBL] [Abstract][Full Text] [Related]  

  • 39. A space-efficient algorithm for the constrained pairwise sequence alignment problem.
    He D; Arslan AN
    Genome Inform; 2005; 16(2):237-46. PubMed ID: 16901106
    [TBL] [Abstract][Full Text] [Related]  

  • 40. A new branch and bound method for the protein folding problem under the 2D-HP model.
    Hsieh SY; Lai DW
    IEEE Trans Nanobioscience; 2011 Jun; 10(2):69-75. PubMed ID: 21742572
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 7.