Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance
HTML
Details
Locations
Year:
2013
Type:
conference-paper
Source:
Lecture notes in computer science
Parent work:
Computing and Combinatorics: 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings
DOI:
10.1007/978-3-642-38768-5_37
Authors:
Kun-Tze Chen,
Chi-Long Li,
Chung-Han Yang,
Chin Lung Lu
Institutions:
National Tsing Hua University,
National Yang Ming Chiao Tung University
Language:
English
Topic:
Genome Rearrangement Algorithms
Subfield:
Genetics
Field:
Biochemistry, Genetics and Molecular Biology
Domain:
Life Sciences
Keywords:
signed permutations,
genome assembly,
genome resequencing,
contig ordering,
permutation groups,
genome rearrangement,
phylogenetic inference,
O(n log n) algorithm
show all 8
Open Access status:
closed
OpenAlex ID:
W98018288
FWCI:
Cites:
14
Cited by:
Related to:
10