메뉴 건너뛰기




Volumn 21, Issue SUPPL. 1, 2005, Pages

Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

EID: 29144460130     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bti1033     Document Type: Article
Times cited : (52)

References (21)
  • 1
    • 10944231221 scopus 로고    scopus 로고
    • The number of recombination events in a sample history: Conflict graph and lower bounds
    • Bafna,V. and Bansal,V. (2004) The number of recombination events in a sample history: Conflict graph and lower bounds. IEEE/ACM Trans. Comput. Biol. Bioinf., 1, 78-90.
    • (2004) IEEE/ACM Trans. Comput. Biol. Bioinf. , vol.1 , pp. 78-90
    • Bafna, V.1    Bansal, V.2
  • 2
    • 29144523520 scopus 로고    scopus 로고
    • Improved recombination lower bounds for haplotype data
    • in press
    • Bafna,V. and Bansal,V. (2005) Improved recombination lower bounds for haplotype data. In Proceedings of RECOMB 2005, in press.
    • (2005) Proceedings of RECOMB 2005
    • Bafna, V.1    Bansal, V.2
  • 4
    • 4644362514 scopus 로고    scopus 로고
    • Application of coalescent methods to reveal fine scale rate variation recombination hotspots
    • Fearnhead,P., Harding,R.M., Schneider,J.A., Myers,S. and Donnelly,P. (2004) Application of coalescent methods to reveal fine scale rate variation and recombination hotspots. Genetics, 167, 2067-2081.
    • (2004) Genetics , vol.167 , pp. 2067-2081
    • Fearnhead, P.1    Harding, R.M.2    Schneider, J.A.3    Myers, S.4    Donnelly, P.5
  • 5
    • 10044231116 scopus 로고    scopus 로고
    • Optimal efficient reconstruction of Root-unknown phylogenetic networks with constrained recombination
    • Technical Report Department of Computer Science University of California Davis CA
    • Gusfield,D. (2004) Optimal, efficient reconstruction of Root-unknown phylogenetic networks with constrained recombination. Technical Report, Department of Computer Science, University of California, Davis, CA.
    • (2004)
    • Gusfield, D.1
  • 6
    • 29144509477 scopus 로고    scopus 로고
    • A new lower bound on the number of needed recombination nodes in both unrooted rooted phylogenetic networks
    • Technical Report UCD-ECS-06 University of California Davis CA
    • Gusfield,D. and Hickerson,D. (2004) A new lower bound on the number of needed recombination nodes in both unrooted and rooted phylogenetic networks. Technical Report UCD-ECS-06, University of California, Davis, CA.
    • (2004)
    • Gusfield, D.1    Hickerson, D.2
  • 7
    • 3242876395 scopus 로고    scopus 로고
    • Optimal efficient reconstruction of phylogenetic networks with constrained recombination
    • Gusfield,D., Eddhu,S. and Langley,C. (2004) Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinf. Comput. Biol., 2, 173-213.
    • (2004) J. Bioinf. Comput. Biol. , vol.2 , pp. 173-213
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 8
    • 0025299784 scopus 로고
    • Reconstructing evolution of sequences subject to recombination using parsimony
    • Hein,J. (1990) Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci., 98, 185-200.
    • (1990) Math. Biosci. , vol.98 , pp. 185-200
    • Hein, J.1
  • 9
    • 0027471670 scopus 로고
    • A heuristic method to reconstruct the history of sequences subject to recombination
    • Hein,J. (1993) A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol., 36, 396-405.
    • (1993) J. Mol. Evol. , vol.36 , pp. 396-405
    • Hein, J.1
  • 10
    • 0036184745 scopus 로고    scopus 로고
    • Generating samples under the Wright-Fisher neutral model of genetic variation
    • Hudson,R. (2002) Generating samples under the Wright-Fisher neutral model of genetic variation. Bioinformatics, 18, 337-338.
    • (2002) Bioinformatics , vol.18 , pp. 337-338
    • Hudson, R.1
  • 11
    • 0022211482 scopus 로고
    • Statistical properties of the number of recombination events in the history of a sample of DNA sequences
    • Hudson,R. and Kaplan,N. (1985) Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics, 111, 147-164.
    • (1985) Genetics , vol.111 , pp. 147-164
    • Hudson, R.1    Kaplan, N.2
  • 12
    • 0039528958 scopus 로고    scopus 로고
    • Reconstructing a history of recombinations from a set of sequences
    • Kececioglu,J.D. and Gusfield,D. (1998) Reconstructing a history of recombinations from a set of sequences. Discrete Appl. Math., 88, 239-260.
    • (1998) Discrete Appl. Math. , vol.88 , pp. 239-260
    • Kececioglu, J.D.1    Gusfield, D.2
  • 13
    • 0020560127 scopus 로고
    • Nucleotide polymorphism at the alcohol dehydrogenase locus of Drosophila melanogaster
    • Kreitman,M. (1983) Nucleotide polymorphism at the alcohol dehydrogenase locus of Drosophila melanogaster. Nature, 304, 412-417.
    • (1983) Nature , vol.304 , pp. 412-417
    • Kreitman, M.1
  • 14
    • 2142773942 scopus 로고    scopus 로고
    • The fine-scale structure of recombination rate variation in the human genome
    • McVean,G.A.T., Myers,S., Hunt,S., Deloukas,P., Bentley,D.R. and Donnelly,P. (2004) The fine-scale structure of recombination rate variation in the human genome. Science, 304, 581-584.
    • (2004) Science , vol.304 , pp. 581-584
    • McVean, G.A.T.1    Myers, S.2    Hunt, S.3    Deloukas, P.4    Bentley, D.R.5    Donnelly, P.6
  • 15
    • 0344289319 scopus 로고    scopus 로고
    • The detection of recombination events using DNA sequence data
    • PhD Thesis Department of Statistics University of Oxford Oxford
    • Myers,S.R. (2002) The detection of recombination events using DNA sequence data. PhD Thesis, Department of Statistics, University of Oxford, Oxford.
    • (2002)
    • Myers, S.R.1
  • 16
    • 0037279717 scopus 로고    scopus 로고
    • Bounds on the minimum number of recombination events in a sample history
    • Myers,S.R. and Griffiths,R.C. (2003) Bounds on the minimum number of recombination events in a sample history. Genetics, 163, 375-394.
    • (2003) Genetics , vol.163 , pp. 375-394
    • Myers, S.R.1    Griffiths, R.C.2
  • 18
    • 35248892541 scopus 로고    scopus 로고
    • Parsimonious reconstruction of sequence evolution haplotype blocks: Finding the minimum number of recombination events
    • BensonG. PageR. (eds) (WABI 2003) Budapest Hungary September 15-20 LNCS 2812. Springer-Verlag NY
    • Song,Y.S. and Hein,J. (2003) Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minimum number of recombination events. In Benson,G. and Page,R. (eds), In Proceedings of the Third International Workshop on Alogarithms in Bioinfomatics (WABI 2003), Budapest, Hungary, September 15-20, LNCS 2812. Springer-Verlag, NY. pp. 287-302.
    • (2003) Proceedings of the Third International Workshop on Alogarithms in Bioinfomatics , pp. 287-302
    • Song, Y.S.1    Hein, J.2
  • 19
    • 16544370982 scopus 로고    scopus 로고
    • On the minimum number of recombination events in the evolutionary history of DNA sequences
    • Song,Y.S. and Hein,J. (2004) On the minimum number of recombination events in the evolutionary history of DNA sequences. J. Math. Biol., 48, 160-186.
    • (2004) J. Math. Biol. , vol.48 , pp. 160-186
    • Song, Y.S.1    Hein, J.2
  • 21
    • 0034913468 scopus 로고    scopus 로고
    • Perfect phylogenetic networks with recombination
    • Wang,L., Zhang,K. and Zhang,L. (2001) Perfect phylogenetic networks with recombination. J. Comput. Biol., 8, 69-78.
    • (2001) J. Comput. Biol. , vol.8 , pp. 69-78
    • Wang, L.1    Zhang, K.2    Zhang, L.3


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