Article

Combinatorial Approaches to Finding Subtle Signals in DNA Sequences

Authors:

Pavel A. Pevzner,

Sing-Hoi SzeAuthors Info & Claims

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology

Pages 269 - 278

Published: 19 August 2000 Publication History

Abstract

No abstract available.

Cited By

View all

Pang S(2021)SOS lower bound for exact planted cliqueProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.26Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2021.26
Hopkins SKothari PPotechin ARaghavendra PSchramm T(2018)On the Integrality Gap of Degree-4 Sum of Squares for Planted CliqueACM Transactions on Algorithms10.1145/317853814:3(1-31)Online publication date: 16-Jun-2018
https://dl.acm.org/doi/10.1145/3178538
Sheng XWang K(2017)Motif identification method based on Gibbs sampling and genetic algorithmCluster Computing10.1007/s10586-016-0699-x20:1(33-41)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1007/s10586-016-0699-x
Show More Cited By

Index Terms

Combinatorial Approaches to Finding Subtle Signals in DNA Sequences
1. Applied computing
  1. Life and medical sciences

Index terms have been assigned to the content through auto-classification.

Recommendations

Combinatorial approaches to signal finding and gene finding in dna sequences
Computational approaches for motif-finding in dna sequences
An Improved Heuristic Algorithm for Finding Motif Signals in DNA Sequences

The planted (l,d)-motif search problem is a mathematical abstraction of the DNA functional site discovery task. In this paper, we propose a heuristic algorithm that can find planted (l,d)-signals in a given set of DNA sequences. Evaluations on simulated ...

Comments

Information & Contributors

Information

Published In

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology

August 2000

426 pages

ISBN:1577351150

Publisher

AAAI Press

Publication History

Published: 19 August 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

87
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pang S(2021)SOS lower bound for exact planted cliqueProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.26Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2021.26
Hopkins SKothari PPotechin ARaghavendra PSchramm T(2018)On the Integrality Gap of Degree-4 Sum of Squares for Planted CliqueACM Transactions on Algorithms10.1145/317853814:3(1-31)Online publication date: 16-Jun-2018
https://dl.acm.org/doi/10.1145/3178538
Sheng XWang K(2017)Motif identification method based on Gibbs sampling and genetic algorithmCluster Computing10.1007/s10586-016-0699-x20:1(33-41)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1007/s10586-016-0699-x
Bergamini ED'Aurizio RLeoncini MPellegrini M(2015)CNVScanProceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health Informatics10.1145/2808719.2808754(335-344)Online publication date: 9-Sep-2015
https://dl.acm.org/doi/10.1145/2808719.2808754
Meka RPotechin AWigderson AServedio RRubinfeld R(2015)Sum-of-squares Lower Bounds for Planted CliqueProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746600(87-96)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2746539.2746600
Leoncini MMontangero MPellegrini MTillan K(2015)CMStalkerIEEE/ACM Transactions on Computational Biology and Bioinformatics10.1109/TCBB.2014.235944412:5(1123-1136)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1109/TCBB.2014.2359444
Tanaka S(2014)Improved exact enumerative algorithms for the planted (l, d)-motif search problemIEEE/ACM Transactions on Computational Biology and Bioinformatics10.1109/TCBB.2014.230684211:2(361-374)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1109/TCBB.2014.2306842
Abbas MBahig HAbouelhoda MMohie-Eldin M(2014)Parallelizing exact motif finding algorithms on multi-coreThe Journal of Supercomputing10.1007/s11227-014-1180-369:2(814-826)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.1007/s11227-014-1180-3
Gottlob GGreco G(2013)Decomposing combinatorial auctions and set packing problemsJournal of the ACM10.1145/2508028.250598760:4(1-39)Online publication date: 4-Sep-2013
https://dl.acm.org/doi/10.1145/2508028.2505987
Boucher CLandau GLevy APritchard DWeimann O(2013)On approximating string selection problems with outliersTheoretical Computer Science10.1016/j.tcs.2013.05.037498(107-114)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.1016/j.tcs.2013.05.037
Show More Cited By

View Options

View options

Get Access

Login options

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

Abstract

Cited By

Index Terms

Recommendations

Combinatorial approaches to signal finding and gene finding in dna sequences

Computational approaches for motif-finding in dna sequences

An Improved Heuristic Algorithm for Finding Motif Signals in DNA Sequences

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations