SCOPUS 정보 검색 플랫폼

Volumn 18, Issue 3, 2002, Pages 492-493

GRIMM: Genome rearrangements web server

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; DATA BASE; DEVICE; GENE; GENE MAPPING; GENE REARRANGEMENT; INTERNET; PRIORITY JOURNAL;

EID: 0036211065 PISSN: 13674803 EISSN: 13674811 Source Type: Journal
DOI: 10.1093/bioinformatics/18.3.492 Document Type: Article

Times cited : (245)

References (9)

1
- 84958047970
- A linear-time algorithm for computing inversion distances between signed permutations with an experimental study
- Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001) Springer, Berlin
- (2001) , pp. 365-376
- Bader, D.¹ Moret, B.² Yan, M.³

2
- 0036143403
- Genome-scale evolution: Reconstructing gene orders in the ancestral species
- (2002) Genome Res , vol.12 , pp. 26-36
- Bourque, G.¹ Pevzner, P.²

3
- 0002721941
- Sorting permutations by reversals and Eulerian cycle decompositions
- (electronic)
- (1999) SIAM J. Discrete Math , vol.12 , pp. 91-110
- Caprara, A.¹

5
- 0029493079
- Transforming men into mice
- (polynomial algorithm for genomic distance problem) (Milwaukee, WI, 1995). IEEE Computer Society Press, Los Alamitos, CA
- (1995) 36th Annual Symposium on Foundations of Computer Science , pp. 581-592
- Hannenhalli, S.¹ Pevzner, P.A.²

6
- 84941152013
- To cut ... or not to cut (applications of comparative physical maps in molecular evolution)
- Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithsm Structures (WADS 2001) (Atlanta, GA, 1996). ACM, New York
- (1996) , pp. 304-313
- Hannenhalli, S.¹ Pevzner, P.²

7
- 0002856077
- Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals
- (1999) J. ACM , vol.46 , pp. 1-27
- Hannenhalli, S.¹ Pevzner, P.A.²

8
- 4243964982
- An algorithm for sorting signed permutations by reversals
- (1999)
- Mantin, I.¹ Shamir, R.²

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