159 related articles for article (PubMed ID: 18586705)
1. The multiple gene duplication problem revisited.
Bansal MS; Eulenstein O
Bioinformatics; 2008 Jul; 24(13):i132-8. PubMed ID: 18586705
[TBL] [Abstract][Full Text] [Related]
2. An Omega(n2/ log n) speed-up of TBR heuristics for the gene-duplication problem.
Bansal MS; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(4):514-24. PubMed ID: 18989039
[TBL] [Abstract][Full Text] [Related]
3. Genomic duplication problems for unrooted gene trees.
Paszek J; Górecki P
BMC Genomics; 2016 Jan; 17 Suppl 1(Suppl 1):15. PubMed ID: 26818591
[TBL] [Abstract][Full Text] [Related]
4. Topological rearrangements and local search method for tandem duplication trees.
Bertrand D; Gascuel O
IEEE/ACM Trans Comput Biol Bioinform; 2005; 2(1):15-28. PubMed ID: 17044161
[TBL] [Abstract][Full Text] [Related]
5. Alignment of minisatellite maps based on run-length encoding scheme.
Abouelhoda MI; Giegerich R; Behzadi B; Steyaert JM
J Bioinform Comput Biol; 2009 Apr; 7(2):287-308. PubMed ID: 19340916
[TBL] [Abstract][Full Text] [Related]
6. DAGchainer: a tool for mining segmental genome duplications and synteny.
Haas BJ; Delcher AL; Wortman JR; Salzberg SL
Bioinformatics; 2004 Dec; 20(18):3643-6. PubMed ID: 15247098
[TBL] [Abstract][Full Text] [Related]
7. Analysis of segmental duplications via duplication distance.
Kahn CL; Raphael BJ
Bioinformatics; 2008 Aug; 24(16):i133-8. PubMed ID: 18689814
[TBL] [Abstract][Full Text] [Related]
8. HapCUT: an efficient and accurate algorithm for the haplotype assembly problem.
Bansal V; Bafna V
Bioinformatics; 2008 Aug; 24(16):i153-9. PubMed ID: 18689818
[TBL] [Abstract][Full Text] [Related]
9. An efficient algorithm for Perfect Phylogeny Haplotyping.
Vijayasatya R; Mukherjee A
Proc IEEE Comput Syst Bioinform Conf; 2005; ():103-10. PubMed ID: 16447968
[TBL] [Abstract][Full Text] [Related]
10. Accurate detection of recombinant breakpoints in whole-genome alignments.
Westesson O; Holmes I
PLoS Comput Biol; 2009 Mar; 5(3):e1000318. PubMed ID: 19300487
[TBL] [Abstract][Full Text] [Related]
11. TreeRefiner: a tool for refining a multiple alignment on a phylogenetic tree.
Manohar A; Batzoglou S
Proc IEEE Comput Syst Bioinform Conf; 2005; ():111-9. PubMed ID: 16447969
[TBL] [Abstract][Full Text] [Related]
12. Inferring duplication episodes from unrooted gene trees.
Paszek J; Górecki P
BMC Genomics; 2018 May; 19(Suppl 5):288. PubMed ID: 29745844
[TBL] [Abstract][Full Text] [Related]
13. Clustering of main orthologs for multiple genomes.
Fu Z; Jiang T
J Bioinform Comput Biol; 2008 Jun; 6(3):573-84. PubMed ID: 18574863
[TBL] [Abstract][Full Text] [Related]
14. Divide-and-conquer approach for the exemplar breakpoint distance.
Nguyen CT; Tay YC; Zhang L
Bioinformatics; 2005 May; 21(10):2171-6. PubMed ID: 15713729
[TBL] [Abstract][Full Text] [Related]
15. Linear-time algorithms for the multiple gene duplication problems.
Luo CW; Chen MC; Chen YC; Yang RW; Liu HF; Chao KM
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):260-5. PubMed ID: 21071814
[TBL] [Abstract][Full Text] [Related]
16. Consensus properties and their large-scale applications for the gene duplication problem.
Moon J; Lin HT; Eulenstein O
J Bioinform Comput Biol; 2016 Jun; 14(3):1642005. PubMed ID: 27122201
[TBL] [Abstract][Full Text] [Related]
17. HomologMiner: looking for homologous genomic groups in whole genomes.
Hou M; Berman P; Hsu CH; Harris RS
Bioinformatics; 2007 Apr; 23(8):917-25. PubMed ID: 17308341
[TBL] [Abstract][Full Text] [Related]
18. Minimizing genomic duplication episodes.
Paszek J; Tiuryn J; Górecki P
Comput Biol Chem; 2020 Dec; 89():107260. PubMed ID: 33038778
[TBL] [Abstract][Full Text] [Related]
19. Breakpoint medians and breakpoint phylogenies: a fixed-parameter approach.
Gramm J; Niedermeier R
Bioinformatics; 2002; 18 Suppl 2():S128-39. PubMed ID: 12385994
[TBL] [Abstract][Full Text] [Related]
20. Clustering of main orthologs for multiple genomes.
Fu Z; Jiang T
Comput Syst Bioinformatics Conf; 2007; 6():195-201. PubMed ID: 17951824
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
