메뉴 건너뛰기




Volumn , Issue , 2008, Pages 527-530

Duplicated genes reversal distance under gene deletion constraint by integer programming

Author keywords

[No Author keywords available]

Indexed keywords

BIOCOMMUNICATIONS; BIOINFORMATICS; BIOMEDICAL ENGINEERING; CONTROL THEORY; DYNAMIC PROGRAMMING; GENES; HEURISTIC ALGORITHMS; INFORMATION SCIENCE; MATHEMATICAL PROGRAMMING;

EID: 51149111828     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICBBE.2008.128     Document Type: Conference Paper
Times cited : (6)

References (5)
  • 1
    • 84937391540 scopus 로고    scopus 로고
    • Genome rearrangement by reversals and insertions/deletions of contiguous segments
    • Proc. 11th Ann. Symp. Combinatorial Pattern Matching CPM'00
    • El-Mabrouk N, Genome rearrangement by reversals and insertions/deletions of contiguous segments, Proc. 11th Ann. Symp. Combinatorial Pattern Matching (CPM'00), Lecture Notes in Computer Science, 1848:222-234, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1848 , pp. 222-234
    • El-Mabrouk, N.1
  • 4
    • 0033391532 scopus 로고    scopus 로고
    • Genome Rearrangement with gene families
    • Sankoff D, Genome Rearrangement with gene families, Bioinformatics, 15:909-917, 1999.
    • (1999) Bioinformatics , vol.15 , pp. 909-917
    • Sankoff, D.1
  • 5
    • 34248184141 scopus 로고    scopus 로고
    • Computing the Reversal distance between Genomes in the Presence of Multi-gene Families via Binary Integer Programming
    • Suksawatchon J, Lursinsap C, Boden M, Computing the Reversal distance between Genomes in the Presence of Multi-gene Families via Binary Integer Programming , Journal of Bioinformatics and Computational Biology,, 5(1), pp.117-133, 2007.
    • (2007) Journal of Bioinformatics and Computational Biology , vol.5 , Issue.1 , pp. 117-133
    • Suksawatchon, J.1    Lursinsap, C.2    Boden, M.3


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