Article

Free access

The complexity of gene placement

Authors:

Süleyman Cenk Sahinalp,

Elizabeth SweedykAuthors Info & Claims

SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Pages 386 - 395

Published: 01 January 1999 Publication History

PDF eReader

References

[1]

V. Bafna and R Pevzner. Genome rearrangements and sorting by reversals. SIAM. J. Computing, 25 272-289, 1996.

Digital Library

Google Scholar

[2]

V. Bafna and P. Pevzner. Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome. Mol. Biol. and Evol., 12 239-246, 1995.

Google Scholar

[3]

S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proc 27th Annual ACM Symposium on the Theory of Computing, pages 178-189, 1995.

Digital Library

Google Scholar

[4]

S. Hannenhalli and P. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problem). In 36th Annual IEEE Symposium on Foundations of Computer Sc/ence, pages 581-592, 1995.

Digital Library

Google Scholar

[5]

S. Hannenhalli and P. Pevzner. To cut .. or not to cut (applications of comparative physical maps in molecular evolution), in Seventh AnnualACM-SIAM Symposium on Discrete Algorithms, pages 304-313, 1996.

Digital Library

Google Scholar

[6]

J. Kececioglu and R. Ravi. Of mice and men: Evolutionary distances between genomes under translocation. In Pro# 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 604-613, 1995.

Digital Library

Google Scholar

[7]

J. Kececioglu and D. Sankoff. Exact and approximation algorithms for the inversion distance between two permutations. Algorithmica, 13 180-210, 1995.

Google Scholar

[8]

J. Kececioglu and D. Sankoff. Efficient bounds for oriented chromosome inversion distance. In Combinatorial Pattern Matching, Proc 5th Annual Symposium (CPM'94), Lecture Notes in Computer Science 807, pages 307-325. Springer-Verlag, Berlin, 1994.

Digital Library

Google Scholar

[9]

S. Letovsky and M.B. Berlyn, CPROP: A Rule-Based Program for Constructing Genetic Maps. Genomics 12 (1992) 435--446.

Google Scholar

[10]

P. Nadkarni, Mapmerge: merge genomic maps. Bioinformatics, 14(4) (1998) 310-316.

Google Scholar

[11]

C.H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes. J. Cornput. System Sci. 43 (1991)425-440.

Google Scholar

[12]

D. Sankoff, G. Leduc, N. Antoine, B. Paquin, B. F. Lang, and R. Cedergren. Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proa Natl. Acad. Sci. USA, 89 6575- 6579, 1992.

Google Scholar

Index Terms

The complexity of gene placement

Recommendations

A statistical method for identifying differential gene--gene co-expression patterns

Motivation: To understand cancer etiology, it is important to explore molecular changes in cellular processes from normal state to cancerous state. Because genes interact with each other during cellular processes, carcinogenesis related genes may ...
Improving disease gene prioritization using the semantic similarity of Gene Ontology terms

Motivation: Many hereditary human diseases are polygenic, resulting from sequence alterations in multiple genes. Genomic linkage and association studies are commonly performed for identifying disease-related genes. Such studies often yield lists of ...
On the Complexity of Gene Marker Selection
SBRN '10: Proceedings of the 2010 Eleventh Brazilian Symposium on Neural Networks

Gene marker selection from gene expression profiles has been extensively investigated in the Bioinformatics literature. The aim is usually to find a compact set of genes potentially correlated to a particular disease, which can then be candidate targets ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

January 1999

992 pages

ISBN:0898714346

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1999

Check for updates

Qualifiers

Article

Conference

SODA99

Sponsor:

SIGACT
SIAM

SODA99: 1999 10th Conference on Discrete Algorithms

January 17 - 19, 1999

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
50
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)13

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

A statistical method for identifying differential gene--gene co-expression patterns

Improving disease gene prioritization using the semantic similarity of Gene Ontology terms

On the Complexity of Gene Marker Selection