125 related articles for article (PubMed ID: 26107890)
1. [Rearrangement and inference of chromosome structures].
Gorbunov KY; Gershgorin RA; Lyubetsky VA
Mol Biol (Mosk); 2015; 49(3):372-83. PubMed ID: 26107890
[TBL] [Abstract][Full Text] [Related]
2. Algorithms for reconstruction of chromosomal structures.
Lyubetsky V; Gershgorin R; Seliverstov A; Gorbunov K
BMC Bioinformatics; 2016 Jan; 17():40. PubMed ID: 26780836
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. Polyploids, genome halving and phylogeny.
Sankoff D; Zheng C; Zhu Q
Bioinformatics; 2007 Jul; 23(13):i433-9. PubMed ID: 17646328
[TBL] [Abstract][Full Text] [Related]
5. Genome halving and double distance with losses.
Savard OT; Gagnon Y; Bertrand D; El-Mabrouk N
J Comput Biol; 2011 Sep; 18(9):1185-99. PubMed ID: 21899424
[TBL] [Abstract][Full Text] [Related]
6. A Cooperative Co-Evolutionary Genetic Algorithm for Tree Scoring and Ancestral Genome Inference.
Gao N; Zhang Y; Feng B; Tang J
IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1248-54. PubMed ID: 26671797
[TBL] [Abstract][Full Text] [Related]
7. Using median sets for inferring phylogenetic trees.
Bernt M; Merkle D; Middendorf M
Bioinformatics; 2007 Jan; 23(2):e129-35. PubMed ID: 17237080
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Genome rearrangement based on reversals that preserve conserved intervals.
Bernt M; Merkle D; Middendorf M
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(3):275-88. PubMed ID: 17048465
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Bayesian coestimation of phylogeny and sequence alignment.
Lunter G; Miklós I; Drummond A; Jensen JL; Hein J
BMC Bioinformatics; 2005 Apr; 6():83. PubMed ID: 15804354
[TBL] [Abstract][Full Text] [Related]
12. Solving the preserving reversal median problem.
Bernt M; Merkle D; Middendorf M
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(3):332-47. PubMed ID: 18670038
[TBL] [Abstract][Full Text] [Related]
13. DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.
Wehe A; Bansal MS; Burleigh JG; Eulenstein O
Bioinformatics; 2008 Jul; 24(13):1540-1. PubMed ID: 18474508
[TBL] [Abstract][Full Text] [Related]
14. Restricted DCJ model: rearrangement problems with chromosome reincorporation.
Kováč J; Warren R; Braga MD; Stoye J
J Comput Biol; 2011 Sep; 18(9):1231-41. PubMed ID: 21899428
[TBL] [Abstract][Full Text] [Related]
15. An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species.
Lin YC; Lu CL; Chang HY; Tang CY
J Comput Biol; 2005; 12(1):102-12. PubMed ID: 15725736
[TBL] [Abstract][Full Text] [Related]
16. Perfect sorting by reversals is not always difficult.
Bérard S; Bergeron A; Chauve C; Paul C
IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):4-16. PubMed ID: 17277409
[TBL] [Abstract][Full Text] [Related]
17. A Bayesian approach to the estimation of ancestral genome arrangements.
Larget B; Kadane JB; Simon DL
Mol Phylogenet Evol; 2005 Aug; 36(2):214-23. PubMed ID: 15893477
[TBL] [Abstract][Full Text] [Related]
18. A new genomic evolutionary model for rearrangements, duplications, and losses that applies across eukaryotes and prokaryotes.
Lin Y; Moret BM
J Comput Biol; 2011 Sep; 18(9):1055-64. PubMed ID: 21899415
[TBL] [Abstract][Full Text] [Related]
19. Using PQ structures for genomic rearrangement phylogeny.
Parida L
J Comput Biol; 2006 Dec; 13(10):1685-700. PubMed ID: 17238839
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
