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 *

120 related articles for article (PubMed ID: 19644172)

  • 1. Improved approximation algorithms for reconstructing the history of tandem repeats.
    Chen ZZ; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(3):438-53. PubMed ID: 19644172
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Finding approximate tandem repeats in genomic sequences.
    Wexler Y; Yakhini Z; Kashi Y; Geiger D
    J Comput Biol; 2005 Sep; 12(7):928-42. PubMed ID: 16201913
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Computing a smallest multilabeled phylogenetic tree from rooted triplets.
    Guillemot S; Jansson J; Sung WK
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1141-7. PubMed ID: 20733243
    [TBL] [Abstract][Full Text] [Related]  

  • 5. T-REKS: identification of Tandem REpeats in sequences with a K-meanS based algorithm.
    Jorda J; Kajava AV
    Bioinformatics; 2009 Oct; 25(20):2632-8. PubMed ID: 19671691
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Reconstructing the duplication history of tandemly repeated genes.
    Elemento O; Gascuel O; Lefranc MP
    Mol Biol Evol; 2002 Mar; 19(3):278-88. PubMed ID: 11861887
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Identifying satellites and periodic repetitions in biological sequences.
    Sagot MF; Myers EW
    J Comput Biol; 1998; 5(3):539-53. PubMed ID: 9773349
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Fast molecular shape matching using contact maps.
    Agarwal PK; Mustafa NH; Wang Y
    J Comput Biol; 2007 Mar; 14(2):131-43. PubMed ID: 17456012
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Reconstructing the duplication history of a tandem repeat.
    Benson G; Dong L
    Proc Int Conf Intell Syst Mol Biol; 1999; ():44-53. PubMed ID: 10786285
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A (1.5 + epsilon)-approximation algorithm for unsigned translocation distance.
    Cui Y; Wang L; Zhu D; Liu X
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(1):56-66. PubMed ID: 18245875
    [TBL] [Abstract][Full Text] [Related]  

  • 12. BWtrs: A tool for searching for tandem repeats in DNA sequences based on the Burrows-Wheeler transform.
    Pokrzywa R; Polanski A
    Genomics; 2010 Nov; 96(5):316-21. PubMed ID: 20709168
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
    Friedrich T; Neumann F
    Evol Comput; 2015; 23(4):543-58. PubMed ID: 26135719
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Zinc finger gene clusters and tandem gene duplication.
    Tang M; Waterman M; Yooseph S
    J Comput Biol; 2002; 9(2):429-46. PubMed ID: 12015891
    [TBL] [Abstract][Full Text] [Related]  

  • 15. The exact joint distribution of the sum of heads and apparent size statistics of a "tandem repeats finder" algorithm.
    Martin DE
    Bull Math Biol; 2006 Nov; 68(8):2353-64. PubMed ID: 16924430
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Reconstructing ancestral genomic sequences by co-evolution: formal definitions, computational issues, and biological examples.
    Tuller T; Birin H; Kupiec M; Ruppin E
    J Comput Biol; 2010 Sep; 17(9):1327-44. PubMed ID: 20874411
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Searching protein three-dimensional structures in faster than linear time.
    Shibuya T
    J Comput Biol; 2010 Apr; 17(4):593-602. PubMed ID: 20426692
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An efficient algorithm for finding short approximate non-tandem repeats.
    Adebiyi EF; Jiang T; Kaufmann M
    Bioinformatics; 2001; 17 Suppl 1():S5-S12. PubMed ID: 11472987
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Estimation of duplication history under a stochastic model for tandem repeats.
    Farnoud F; Schwartz M; Bruck J
    BMC Bioinformatics; 2019 Feb; 20(1):64. PubMed ID: 30727948
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.