Similar articles for PMID: 21282867

Year	Number of Results
1930	1
1979	1
1980	1
1982	1
1984	1
1985	8
1986	4
1987	13
1988	11
1989	6
1990	4
1991	6
1992	5
1993	8
1994	9
1995	20
1996	12
1998	2
1999	4
2000	5
2001	4
2002	3
2003	7
2004	7
2005	3
2006	5
2007	6
2008	8
2009	7
2010	15
2011	17
2012	16
2013	11
2014	18
2015	15
2016	25
2017	16
2018	16
2019	13
2020	12
2021	12
2022	15
2023	4
2024	0

1

Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.

Chen ZZ, Wang L. Chen ZZ, et al. IEEE/ACM Trans Comput Biol Bioinform. 2011 Sep-Oct;8(5):1400-10. doi: 10.1109/TCBB.2011.21. IEEE/ACM Trans Comput Biol Bioinform. 2011. PMID: 21282867

2

Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.

Tanaka S. Tanaka S. IEEE/ACM Trans Comput Biol Bioinform. 2014 Mar-Apr;11(2):361-74. doi: 10.1109/TCBB.2014.2306842. IEEE/ACM Trans Comput Biol Bioinform. 2014. PMID: 26355783 Free article.

3

Efficient sequential and parallel algorithms for finding edit distance based motifs.

Pal S, Xiao P, Rajasekaran S. Pal S, et al. BMC Genomics. 2016 Aug 18;17 Suppl 4(Suppl 4):465. doi: 10.1186/s12864-016-2789-9. BMC Genomics. 2016. PMID: 27557423 Free PMC article.

4

On the hardness of counting and sampling center strings.

Boucher C, Omar M. Boucher C, et al. IEEE/ACM Trans Comput Biol Bioinform. 2012 Nov-Dec;9(6):1843-6. doi: 10.1109/TCBB.2012.84. IEEE/ACM Trans Comput Biol Bioinform. 2012. PMID: 22641713

5

Fast and practical algorithms for planted (l, d) motif search.

Davila J, Balla S, Rajasekaran S. Davila J, et al. IEEE/ACM Trans Comput Biol Bioinform. 2007 Oct-Dec;4(4):544-52. doi: 10.1109/TCBB.2007.70241. IEEE/ACM Trans Comput Biol Bioinform. 2007. PMID: 17975266

6

PMS6: a fast algorithm for motif discovery.

Bandyopadhyay S, Sahni S, Rajasekaran S. Bandyopadhyay S, et al. Int J Bioinform Res Appl. 2014;10(4-5):369-83. doi: 10.1504/IJBRA.2014.062990. Int J Bioinform Res Appl. 2014. PMID: 24989858

7

SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets.

Yu Q, Wei D, Huo H. Yu Q, et al. BMC Bioinformatics. 2018 Jun 18;19(1):228. doi: 10.1186/s12859-018-2242-y. BMC Bioinformatics. 2018. PMID: 29914360 Free PMC article.

8

An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.

Yu Q, Huo H, Vitter JS, Huan J, Nekrich Y. Yu Q, et al. IEEE/ACM Trans Comput Biol Bioinform. 2015 Mar-Apr;12(2):384-97. doi: 10.1109/TCBB.2014.2361668. IEEE/ACM Trans Comput Biol Bioinform. 2015. PMID: 26357225

9

Experimental study of modified voting algorithm for planted (l,d)-motif problem.

Bahig HM, Abbas MM, Bhery A. Bahig HM, et al. Adv Exp Med Biol. 2010;680:65-73. doi: 10.1007/978-1-4419-5913-3_8. Adv Exp Med Biol. 2010. PMID: 20865487

10

Closest string with outliers.

Boucher C, Ma B. Boucher C, et al. BMC Bioinformatics. 2011 Feb 15;12 Suppl 1(Suppl 1):S55. doi: 10.1186/1471-2105-12-S1-S55. BMC Bioinformatics. 2011. PMID: 21342588 Free PMC article.

Save citations to file

Email citations

Send citations to clipboard

Add to Collections

Add to My Bibliography

Create a file for external citation management software

Your saved search

Your RSS Feed

My NCBI Filters

Results by year

Text availability

Article attribute

Article type

Publication date

358 results

Results by year