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 *

193 related articles for article (PubMed ID: 17277417)

  • 1. Colored de Bruijn graphs and the genome halving problem.
    Alekseyev MA; Pevzner PA
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):98-107. PubMed ID: 17277417
    [TBL] [Abstract][Full Text] [Related]  

  • 2. What is the difference between the breakpoint graph and the de Bruijn graph?
    Lin Y; Nurk S; Pevzner PA
    BMC Genomics; 2014; 15 Suppl 6(Suppl 6):S6. PubMed ID: 25572416
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Multi-break rearrangements and breakpoint re-uses: from circular to linear genomes.
    Alekseyev MA
    J Comput Biol; 2008 Oct; 15(8):1117-31. PubMed ID: 18788907
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Genome halving with double cut and join.
    Warren R; Sankoff D
    J Bioinform Comput Biol; 2009 Apr; 7(2):357-71. PubMed ID: 19340920
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A fast and exact algorithm for the median of three problem: a graph decomposition approach.
    Xu AW
    J Comput Biol; 2009 Oct; 16(10):1369-81. PubMed ID: 19747038
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs.
    Alexeev N; Pologova A; Alekseyev MA
    J Comput Biol; 2017 Feb; 24(2):93-105. PubMed ID: 28045556
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
    Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
    BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A statistically fair comparison of ancestral genome reconstructions, based on breakpoint and rearrangement distances.
    Adam Z; Sankoff D
    J Comput Biol; 2010 Sep; 17(9):1299-314. PubMed ID: 20874410
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance.
    Feijão P; Martinez F; Thévenin A
    BMC Bioinformatics; 2015; 16 Suppl 19(Suppl 19):S1. PubMed ID: 26695008
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Genome rearrangements in mammalian evolution: lessons from human and mouse genomes.
    Pevzner P; Tesler G
    Genome Res; 2003 Jan; 13(1):37-45. PubMed ID: 12529304
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Multichromosomal median and halving problems under different genomic distances.
    Tannier E; Zheng C; Sankoff D
    BMC Bioinformatics; 2009 Apr; 10():120. PubMed ID: 19386099
    [TBL] [Abstract][Full Text] [Related]  

  • 12. On the complexity of rearrangement problems under the breakpoint distance.
    Kováč J
    J Comput Biol; 2014 Jan; 21(1):1-15. PubMed ID: 24200391
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Breakpoint graphs and ancestral genome reconstructions.
    Alekseyev MA; Pevzner PA
    Genome Res; 2009 May; 19(5):943-57. PubMed ID: 19218533
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On the similarity of sets of permutations and its applications to genome comparison.
    Bergeron A; Stoye J
    J Comput Biol; 2006 Sep; 13(7):1340-54. PubMed ID: 17037962
    [TBL] [Abstract][Full Text] [Related]  

  • 15. On the Hardness of Sequence Alignment on De Bruijn Graphs.
    Gibney D; Thankachan SV; Aluru S
    J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Paths and cycles in breakpoint graph of random multichromosomal genomes.
    Xu W; Zheng C; Sankoff D
    J Comput Biol; 2007 May; 14(4):423-35. PubMed ID: 17572021
    [TBL] [Abstract][Full Text] [Related]  

  • 18. SCJ: a breakpoint-like distance that simplifies several rearrangement problems.
    Feijão P; Meidanis J
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1318-29. PubMed ID: 21339538
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.
    Bader M; Abouelhoda MI; Ohlebusch E
    BMC Bioinformatics; 2008 Dec; 9():516. PubMed ID: 19055792
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs.
    Holley G; Melsted P
    Genome Biol; 2020 Sep; 21(1):249. PubMed ID: 32943081
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.