SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3109, Issue , 2004, Pages 32-46

Sorting by length-weighted reversals: Dealing with signs and circularity

(6) Swidan, Firas a Bender, Michael A b Ge, Dongdong b He, Simai b Hu, Haodong b Pinter, Ron Y a

a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY (Israel)

b Stony Brook University (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

CIRCULAR PERMUTATION; COST MODELING; GUARANTEED APPROXIMATION RATIOS; LINEAR SEQUENCE; LOWER AND UPPER BOUNDS; POLYNOMIAL-TIME ALGORITHMS; TWO DIRECTIONS;

COST FUNCTIONS;

EID: 35048854608 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-27801-6_3 Document Type: Article

Times cited : (21)

References (9)

1
- 0000791476
- Lengths of chromosomal segments conserved since divergence of man and mouse
- Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA 81 (1984) 814-818
- (1984) Proc. Natl. Acad. Sci. USA , vol.81 , pp. 814-818
- Nadeau, J.H.¹ Taylor, B.A.²

2
- 19544373665
- Sorting with length-weighted reversals
- Pinter, R., Skiena, S.: Sorting with length-weighted reversals. In: Proc. 13th International Conference on Genome Informatics (GIW). (2002) 173-182
- (2002) Proc. 13th International Conference on Genome Informatics (GIW). , pp. 173-182
- Pinter, R.¹ Skiena, S.²

3
- 1842434544
- Improved bounds on sorting with length-weighted reversals
- Bender, M., Ge, D., He, S., Hu, H., Pinter, R., Skiena, S., Swidan, F.: Improved bounds on sorting with length-weighted reversals. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). (2004) 912-921
- (2004) Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp. 912-921
- Bender, M.¹ Ge, D.² He, S.³ Hu, H.⁴ Pinter, R.⁵ Skiena, S.⁶ Swidan, F.⁷

4
- 0003921505
- MIT Press, Cambridge MA
- Pevzner, P.A.: Computational Molecular Biology - an Algorithmic Approach. MIT Press, Cambridge MA (2000)
- (2000) Computational Molecular Biology - An Algorithmic Approach
- Pevzner, P.A.¹

5
- 84956970575
- A very elementary presentation of the hannenhalli-pevzner theory
- Bergeron, A.: A very elementary presentation of the hannenhalli-pevzner theory. In: Proc. 12th Symp. Combinatorial Pattern Matching (CPM). (2001) 106-117
- (2001) Proc. 12th Symp. Combinatorial Pattern Matching (CPM) , pp. 106-117
- Bergeron, A.¹

6
- 0039577309
- Sorting with fixed-length reversals
- Chen, T., Skiena, S.: Sorting with fixed-length reversals. Discrete Applied Mathematics 71 (1996) 269-295
- (1996) Discrete Applied Mathematics , vol.71 , pp. 269-295
- Chen, T.¹ Skiena, S.²

7
- 35248843119
- A simpler 1.5-approximation algorithm for sorting by transpositions
- Hartman, T.: A simpler 1.5-approximation algorithm for sorting by transpositions. In: Proc. 14th Symp. Combinatorial Pattern Matching (CPM). (2003) 156-169
- (2003) Proc. 14th Symp. Combinatorial Pattern Matching (CPM) , pp. 156-169
- Hartman, T.¹

8
- 0242659445
- Sorting strings by reversals and by transpositions
- Christie, D.A., Irving, R.W.: Sorting strings by reversals and by transpositions. SIAM J. on Discrete Math 14 (2001) 193-206
- (2001) SIAM J. on Discrete Math , vol.14 , pp. 193-206
- Christie, D.A.¹ Irving, R.W.²

9
- 0030130366
- Genome rearrangements and sorting by reversals
- Bafha, V., Pevzner, P.: Genome rearrangements and sorting by reversals. SIAM J. Computing 25 (1996) 272-289
- (1996) SIAM J. Computing , vol.25 , pp. 272-289
- Bafha, V.¹ Pevzner, P.²

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