SCOPUS 정보 검색 플랫폼

Journal of Computational Biology

Volumn 18, Issue 9, 2011, Pages 1231-1241

Restricted DCJ model: Rearrangement problems with chromosome reincorporation

(4) Kováč, Jakub a,b Warren, Robert c Braga, Marília D V b Stoye, Jens b

a Faculty of Natural Sciences (Slovakia)

b BIELEFELD UNIVERSITY (Germany)

c UNIVERSITY OF OTTAWA (Canada)

Author keywords

chromosome reincorporation; DCJ; genome rearrangements; halving; median; NP completeness; sorting

Indexed keywords

ALGORITHM; BIOLOGICAL MODEL; CHROMOSOME; COMPUTER SIMULATION; CONFERENCE PAPER; GENE REARRANGEMENT; GENETICS; GENOME; MOLECULAR EVOLUTION; MUTATION; PLOIDY;

ALGORITHMS; CHROMOSOMES; COMPUTER SIMULATION; EVOLUTION, MOLECULAR; GENE REARRANGEMENT; GENOME; MODELS, GENETIC; MUTATION; PLOIDIES;

EID: 80052639343 PISSN: 10665277 EISSN: None Source Type: Journal
DOI: 10.1089/cmb.2011.0116 Document Type: Conference Paper

Times cited : (11)

References (15)

1
- 33847705287
- Colored de Bruijn graphs and the genome halving problem
- DOI 10.1109/TCBB.2007.1002
- Alekseyev, M., and Pevzner, P. 2007. Colored de Bruijn graphs and the genome halving problem. IEEE Trans. Comput. Biol. Bioinform. 98-107. (Pubitemid 46375819)
- (2007) IEEE/ACM Transactions on Computational Biology and Bioinformatics , vol.4 , Issue.1 , pp. 98-107
- Alekseyev, M.A.¹ Pevzner, P.A.²

2
- 70349838725
- Computation of perfect DCJ rearrangement scenarios with linear and circular chromosomes
- Bérard, S., Chateau, A., Chauve, C., et al. 2009. Computation of perfect DCJ rearrangement scenarios with linear and circular chromosomes. J. Comput. Biol. 16, 1287-1309.
- (2009) J. Comput. Biol. , vol.16 , pp. 1287-1309
- Bérard, S.¹ Chateau, A.² Chauve, C.³

3
- 33750264868
- A unifying view of genome rearrangements
- Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings
- Bergeron, A., Mixtacki, J., and Stoye, J. 2006. A unifying view of genome rearrangements. Proc. WABI, 163-173. (Pubitemid 44609667)
- (2006) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol.4175 , pp. 163-173
- Bergeron, A.¹ Mixtacki, J.² Stoye, J.³

4
- 3843132934
- The reversal median problem
- Caprara, A. 2003. The reversal median problem. INFORMS J. Comp. 15, 93.
- (2003) INFORMS J. Comp. , vol.15 , pp. 93
- Caprara, A.¹

5
- 0030285740
- Sorting permutations by block-interchanges
- DOI 10.1016/S0020-0190(96)00155-X, PII S002001909600155X
- Christie, D.A. 1996. Sorting permutations by block-interchanges. Inf. Process. Lett. 60, 165-169. (Pubitemid 126383390)
- (1996) Information Processing Letters , vol.60 , Issue.4 , pp. 165-169
- Christie, D.A.¹

6
- 0025419380
- Data structure useful for finding Hamiltonian cycles
- DOI 10.1016/0304-3975(90)90053-K
- Chrobak, M., Szymacha, T., and Krawczyk, A. 1990. A data structure useful for finding hamiltonian cycles. Theor. Comput. Sci. 71, 419-424. (Pubitemid 20686127)
- (1990) Theoretical Computer Science , vol.71 , Issue.3 , pp. 419-424
- Chrobak, M.¹ Szymacha, T.² Krawczyk, A.³

7
- 0037623969
- The reconstruction of doubled genomes
- El-Mabrouk, N., and Sankoff, D. 2003. The reconstruction of doubled genomes. SIAM J. Comput. 32, 754-792.
- (2003) SIAM J. Comput. , vol.32 , pp. 754-792
- El-Mabrouk, N.¹ Sankoff, D.²

8
- 34548256218
- Faster algorithms for sorting by transpositions and sorting by block interchanges
- Feng, J., and Zhu, D. 2007. Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Trans. Algorithms 3.
- (2007) ACM Trans. Algorithms , pp. 3
- Feng, J.¹ Zhu, D.²

9
- 15344349566
- Sorting signed permutations by reversals, revisited
- DOI 10.1016/j.jcss.2004.12.002, PII S0022000004001503, Bioinformatics
- Kaplan, H., and Verbin, E. 2005. Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. 70, 321-341 (Pubitemid 40391413)
- (2005) Journal of Computer and System Sciences , vol.70 , Issue.3 , pp. 321-341
- Kaplan, H.¹ Verbin, E.²

10
- 78649944195
- The problem of chromosome reincorporation in DCJ sorting and halving
- Kováč, J., Braga, M.D.V., and Stoye, J. 2010. The problem of chromosome reincorporation in DCJ sorting and halving. Lect. Notes Comput. Sci. 6398, 13-24.
- (2010) Lect. Notes Comput. Sci. , vol.6398 , pp. 13-24
- Kováč, J.¹

11
- 48249112137
- Genome halving under DCJ revisited
- Mixtacki, J. 2008. Genome halving under DCJ revisited. Lect. Notes Comput. Sci. 5092, 276-286.
- (2008) Lect. Notes Comput. Sci. , vol.5092 , pp. 276-286
- Mixtacki, J.¹

12
- 77950836402
- Sorting signed permutations by inversions in O(n log n) time
- Swenson, K.M., Rajan, V., Lin, Y., et al. 2010. Sorting signed permutations by inversions in O(n log n) time. J. Comput. Biol. 17, 489-501.
- (2010) J. Comput. Biol. , vol.17 , pp. 489-501
- Swenson, K.M.¹ Rajan, V.² Lin, Y.³

13
- 65849156401
- Multichromosomal median and halving problems under different genomic distances
- Tannier, E., Zheng, C., and Sankoff, D. 2009. Multichromosomal median and halving problems under different genomic distances. BMC Bioinform. 10, 120.
- (2009) BMC Bioinform. , vol.10 , pp. 120
- Tannier, E.¹ Zheng, C.² Sankoff, D.³

14
- 65449136686
- Genome halving with double cut andjoin
- Warren, R., and Sankoff, D. 2009. Genome halving with double cut andjoin. J. Bioinform. Comput. Biol. 7, 357-371.
- (2009) J. Bioinform. Comput. Biol. , vol.7 , pp. 357-371
- Warren, R.¹ Sankoff, D.²

15
- 24044535485
- Efficient sorting of genomic permutations by translocation, inversion and block interchange
- DOI 10.1093/bioinformatics/bti535
- Yancopoulos, S., Attie, O., and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346. (Pubitemid 41222437)
- (2005) Bioinformatics , vol.21 , Issue.16 , pp. 3340-3346
- Yancopoulos, S.¹ Attie, O.² Friedberg, R.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.