-
1
-
-
0033391532
-
Genome Rearrangement with Gene Families
-
D. Sankoff, "Genome Rearrangement with Gene Families," Bioinformatics, vol. 15, no. 11, pp. 909-917, 1999.
-
(1999)
Bioinformatics
, vol.15
, Issue.11
, pp. 909-917
-
-
Sankoff, D.1
-
2
-
-
26844550399
-
The Breakpoint Distance for Signed Sequences
-
G. Blin, C. Chauve, and G. Fertin, "The Breakpoint Distance for Signed Sequences," Proc. Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets '04), pp. 3-16, 2004.
-
(2004)
Proc. Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets '04)
, pp. 3-16
-
-
Blin, G.1
Chauve, C.2
Fertin, G.3
-
3
-
-
0026680446
-
Gene Order Comparisons for Phylogenetic Inference: Evolution of the Mitochondrial Genome
-
D. Sankoff, G. Leduc, N. Antoine, B. Paquin, B. Lang, and R. Cedergren, "Gene Order Comparisons for Phylogenetic Inference: Evolution of the Mitochondrial Genome," Proc. Nat'l Academy of Sciences USA, vol. 89, no. 14, pp. 6575-6579, 1992.
-
(1992)
Proc. Nat'l Academy of Sciences USA
, vol.89
, Issue.14
, pp. 6575-6579
-
-
Sankoff, D.1
Leduc, G.2
Antoine, N.3
Paquin, B.4
Lang, B.5
Cedergren, R.6
-
4
-
-
12744263078
-
Comparative Architectures of Mammalian and Chicken Genomes Reveal Highly Variable Rates of Genomic Rearrangements across Different Lineages
-
G. Bourque, E. Zdobnov, P. Bork, P. Pevzner, and G. Tesler, "Comparative Architectures of Mammalian and Chicken Genomes Reveal Highly Variable Rates of Genomic Rearrangements across Different Lineages," Genome Research, vol. 15, no. 1, pp. 98-110, 2005.
-
(2005)
Genome Research
, vol.15
, Issue.1
, pp. 98-110
-
-
Bourque, G.1
Zdobnov, E.2
Bork, P.3
Pevzner, P.4
Tesler, G.5
-
5
-
-
0035546156
-
Gene and Genome Duplication
-
D. Sankoff, "Gene and Genome Duplication," Current Opinion in Genetics Development, vol. 11, no. 6, pp. 681-684, 2001.
-
(2001)
Current Opinion in Genetics Development
, vol.11
, Issue.6
, pp. 681-684
-
-
Sankoff, D.1
-
6
-
-
0036499057
-
Shot: A Web Server for the Construction of Genome Phytogenies
-
J. Korbel, D. Snel, M. Huynen, and P. Bork, "Shot: A Web Server for the Construction of Genome Phytogenies," Trends in Genetics, vol. 18, no. 3, pp. 158-162, 2002.
-
(2002)
Trends in Genetics
, vol.18
, Issue.3
, pp. 158-162
-
-
Korbel, J.1
Snel, D.2
Huynen, M.3
Bork, P.4
-
7
-
-
19544374490
-
Genome Rearrangement Distances and Gene Order Phylogeny in 7-Proteobacteria
-
E. Belda, A. Moya, and F. Silva, "Genome Rearrangement Distances and Gene Order Phylogeny in 7-Proteobacteria," Molecular Biology Evolution, vol. 22, no. 6, pp. 1456-1467, 2005.
-
(2005)
Molecular Biology Evolution
, vol.22
, Issue.6
, pp. 1456-1467
-
-
Belda, E.1
Moya, A.2
Silva, F.3
-
8
-
-
33750303924
-
Inferring Positional Homologs with Common Intervals of Sequences
-
G. Blin, A. Chateau, C. Chauve, and Y. Gingras, "Inferring Positional Homologs with Common Intervals of Sequences," Proc. RECOMB Int'l Workshop Comparative Genomics (RCG '06), pp. 24-38, 2006.
-
(2006)
Proc. RECOMB Int'l Workshop Comparative Genomics (RCG '06)
, pp. 24-38
-
-
Blin, G.1
Chateau, A.2
Chauve, C.3
Gingras, Y.4
-
9
-
-
4544335270
-
The Complexity of Calculating Exemplar Distances
-
Kluwer Academic
-
D. Bryant, "The Complexity of Calculating Exemplar Distances," Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207-212, Kluwer Academic, 2000.
-
(2000)
Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families
, pp. 207-212
-
-
Bryant, D.1
-
10
-
-
30344450783
-
Assignment of Orthologous Genes via Genome Rearrangement
-
Oct.-Dec
-
X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, and T. Jiang, "Assignment of Orthologous Genes via Genome Rearrangement," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 2, no. 4, pp. 302-315, Oct.-Dec. 2005.
-
(2005)
IEEE/ACM Trans. Computational Biology and Bioinformatics
, vol.2
, Issue.4
, pp. 302-315
-
-
Chen, X.1
Zheng, J.2
Fu, Z.3
Nan, P.4
Zhong, Y.5
Lonardi, S.6
Jiang, T.7
-
11
-
-
32144446113
-
Approximating the True Evolutionary Distance between Two Genomes
-
K. Swenson, M. Marron, J. Earnest-DeYoung, and B. Moret, "Approximating the True Evolutionary Distance between Two Genomes," Proc. Seventh Workshop Algorithm Eng. and Experiments and Second Workshop Analytic Algorithmics and Combinatorics (ALENEXIANALCO '05), pp. 121-129, 2005.
-
(2005)
Proc. Seventh Workshop Algorithm Eng. and Experiments and Second Workshop Analytic Algorithmics and Combinatorics (ALENEXIANALCO '05)
, pp. 121-129
-
-
Swenson, K.1
Marron, M.2
Earnest-DeYoung, J.3
Moret, B.4
-
12
-
-
34250336698
-
Algorithms for Calculating Exemplar Distances
-
honours Year Project Report, Nat'l Univ. of Singapore
-
N.C. Thach, "Algorithms for Calculating Exemplar Distances," honours Year Project Report, Nat'l Univ. of Singapore, 2005.
-
(2005)
-
-
Thach, N.C.1
-
13
-
-
33746238850
-
The Approximability of the Exemplar Breakpoint Distance Problem
-
June
-
Z. Chen, B. Fu, and B. Zhu, "The Approximability of the Exemplar Breakpoint Distance Problem," Proc. Second Int'l Conf. Algorithmic Aspects in Information and Management (AAIM '06), pp. 291-302, June 2006.
-
(2006)
Proc. Second Int'l Conf. Algorithmic Aspects in Information and Management (AAIM '06)
, pp. 291-302
-
-
Chen, Z.1
Fu, B.2
Zhu, B.3
-
14
-
-
4544242008
-
Genomic Distances under Deletions and Insertions
-
M. Marron, K. Swenson, and B. Moret, "Genomic Distances under Deletions and Insertions," Theoretical Computer Science, vol. 325, no. 3, pp. 347-360, 2004.
-
(2004)
Theoretical Computer Science
, vol.325
, Issue.3
, pp. 347-360
-
-
Marron, M.1
Swenson, K.2
Moret, B.3
-
16
-
-
33745794001
-
A Parsimony Approach to Genome-Wide Ortholog Assignment
-
Apr
-
Z. Fu, X. Chen, V. Vacie, P. Nan, Y. Zhong, and J. Tang, "A Parsimony Approach to Genome-Wide Ortholog Assignment," Proc. 10th Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '06), pp. 578-594, Apr. 2006.
-
(2006)
Proc. 10th Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '06)
, pp. 578-594
-
-
Fu, Z.1
Chen, X.2
Vacie, V.3
Nan, P.4
Zhong, Y.5
Tang, J.6
-
17
-
-
19544362070
-
Divide-and-Conquer Approach for the Exemplar Breakpoint Distance
-
C. Nguyen, Y. Tay, and L. Zhang, "Divide-and-Conquer Approach for the Exemplar Breakpoint Distance," Bioinformatics, vol. 21, no. 10, pp. 2171-2176, 2005.
-
(2005)
Bioinformatics
, vol.21
, Issue.10
, pp. 2171-2176
-
-
Nguyen, C.1
Tay, Y.2
Zhang, L.3
-
19
-
-
33646151623
-
Maximizing Synteny Blocks to Identify Ancestral Homologs
-
Sept
-
G. Bourque, Y. Yacef, and N. El-Mabrouk, "Maximizing Synteny Blocks to Identify Ancestral Homologs," Proc. RECOMB Int'l Workshop Comparative Genomics (RCG '05), pp. 21-34, Sept. 2005.
-
(2005)
Proc. RECOMB Int'l Workshop Comparative Genomics (RCG '05)
, pp. 21-34
-
-
Bourque, G.1
Yacef, Y.2
El-Mabrouk, N.3
-
20
-
-
33749551283
-
Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes
-
Z. Chen, R. Fowler, B. Fu, and B. Zhu, "Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes," Proc. 12th Ann. Int'l Conf. Computing and Combinatorics (COCOON '06), pp. 245-254, 2006.
-
(2006)
Proc. 12th Ann. Int'l Conf. Computing and Combinatorics (COCOON '06)
, pp. 245-254
-
-
Chen, Z.1
Fowler, R.2
Fu, B.3
Zhu, B.4
-
25
-
-
0026366408
-
Optimization, Approximation, and Complexity Classes
-
C.H. Papadimitriou and M. Yannakakis, "Optimization, Approximation, and Complexity Classes," J. Computer and System Sciences, vol. 43, pp. 425-440, 1991.
-
(1991)
J. Computer and System Sciences
, vol.43
, pp. 425-440
-
-
Papadimitriou, C.H.1
Yannakakis, M.2
-
26
-
-
0032108328
-
A Threshold of ln(n) for Approximating Set Cover
-
U. Feige, "A Threshold of ln(n) for Approximating Set Cover," J. ACM, vol. 4, no. 45, pp. 634-652, 1998.
-
(1998)
J. ACM
, vol.4
, Issue.45
, pp. 634-652
-
-
Feige, U.1
-
27
-
-
84896748803
-
Positioning Guards at Fixed Height above a Terrain - An Optimum Inapproximability Result
-
S. Eidenbenz, C. Stamm, and P. Widmayer, "Positioning Guards at Fixed Height above a Terrain - An Optimum Inapproximability Result," Proc. Sixth European Symp. Algorithms (ESA '98), pp. 187-198, 1998.
-
(1998)
Proc. Sixth European Symp. Algorithms (ESA '98)
, pp. 187-198
-
-
Eidenbenz, S.1
Stamm, C.2
Widmayer, P.3
-
28
-
-
33750321236
-
How Pseudo-Boolean Programming Can Help Genome Rearrangement Distance Computation
-
S. Angibaud, G. Fertin, I. Rusu, and S. Vialette, "How Pseudo-Boolean Programming Can Help Genome Rearrangement Distance Computation," Proc RECOMB 2006 Int'l Workshop Comparative Genomics (RCG '06), pp. 75-86, 2006.
-
(2006)
Proc RECOMB 2006 Int'l Workshop Comparative Genomics (RCG '06)
, pp. 75-86
-
-
Angibaud, S.1
Fertin, G.2
Rusu, I.3
Vialette, S.4
|