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 *

141 related articles for article (PubMed ID: 18451439)

  • 1. Shorelines of islands of tractability: algorithms for parsimony and minimum perfect phylogeny haplotyping problems.
    van Iersel L; Keijsper J; Kelk S; Stougie L
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(2):301-12. PubMed ID: 18451439
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Islands of tractability for parsimony haplotyping.
    Sharan R; Halldórsson BV; Istrail S
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(3):303-11. PubMed ID: 17048467
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Computational problems in perfect phylogeny haplotyping: typing without calling the allele.
    Barzuza T; Beckmann JS; Shamir R; Pe'er I
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(1):101-9. PubMed ID: 18245879
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Islands of tractability for parsimony haplotyping.
    Sharan R; Halldósson BV; Istrail S
    Proc IEEE Comput Syst Bioinform Conf; 2005; ():65-72. PubMed ID: 16447963
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An optimal algorithm for perfect phylogeny haplotyping.
    Vijayasatya R; Mukherjee A
    J Comput Biol; 2006 May; 13(4):897-928. PubMed ID: 16761918
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Tractable Cases of (*,2)-Bounded Parsimony Haplotyping.
    Keijsper J; Oosterwijk T
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):234-47. PubMed ID: 26357092
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Haplotyping as perfect phylogeny: a direct approach.
    Bafna V; Gusfield D; Lancia G; Yooseph S
    J Comput Biol; 2003; 10(3-4):323-40. PubMed ID: 12935331
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Haplotype inference constrained by plausible haplotype data.
    Fellows MR; Hartman T; Hermelin D; Landau GM; Rosamond F; Rozenberg L
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(6):1692-9. PubMed ID: 20733241
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Optimal imperfect phylogeny reconstruction and haplotyping (IPPH).
    Sridhar S; Blelloch GE; Ravi R; Schwartz R
    Comput Syst Bioinformatics Conf; 2006; ():199-210. PubMed ID: 17369638
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Toward an algebraic understanding of haplotype inference by pure parsimony.
    Brown DG; Harrower IM
    Comput Syst Bioinformatics Conf; 2006; ():211-22. PubMed ID: 17369639
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Haplotype inferring via galled-tree networks is NP-complete.
    Gupta A; Karimi MM; Manuch J; Stacho L; Zhao X
    J Comput Biol; 2010 Oct; 17(10):1435-49. PubMed ID: 20937016
    [TBL] [Abstract][Full Text] [Related]  

  • 12. The undirected incomplete perfect phylogeny problem.
    Satya RV; Mukherjee A
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(4):618-29. PubMed ID: 18989047
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Algorithm for haplotype inference via galled-tree networks with simple galls.
    Gupta A; Maňuch J; Stacho L; Zhao X
    J Comput Biol; 2012 Apr; 19(4):439-54. PubMed ID: 22468709
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Pure parsimony xor haplotyping.
    Bonizzoni P; Della Vedova G; Dondi R; Pirola Y; Rizzi R
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):598-610. PubMed ID: 20498511
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples.
    Hujdurovic A; Kacar U; Milanic M; Ries B; Tomescu AI
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(1):96-108. PubMed ID: 28113405
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Efficient reconstruction of haplotype structure via perfect phylogeny.
    Eskin E; Halperin E; Karp RM
    J Bioinform Comput Biol; 2003 Apr; 1(1):1-20. PubMed ID: 15290779
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem.
    Ding Z; Filkov V; Gusfield D
    J Comput Biol; 2006 Mar; 13(2):522-53. PubMed ID: 16597255
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Direct maximum parsimony phylogeny reconstruction from genotype data.
    Sridhar S; Lam F; Blelloch GE; Ravi R; Schwartz R
    BMC Bioinformatics; 2007 Dec; 8():472. PubMed ID: 18053244
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Refining phylogenetic trees given additional data: an algorithm based on parsimony.
    Wu T; Moulton V; Steel M
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):118-25. PubMed ID: 19179705
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.