![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
John L. Spouge
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j18]Martin C. Frith
, Jim Shaw
, John L. Spouge
:
How to optimally sample a sequence for rapid analysis. Bioinform. 39(2) (2023) - 2022
- [j17]John L. Spouge
:
A closed formula relevant to 'Theory of local k-mer selection with applications to long-read alignment' by Jim Shaw and Yun William Yu. Bioinform. 38(20): 4848-4849 (2022) - 2020
- [j16]John L. Spouge
, Joseph M. Ziegelbauer, Mileidy Gonzalez:
A linear-time algorithm that avoids inverses and computes Jackknife (leave-one-out) products like convolutions or other operators in commutative semigroups. Algorithms Mol. Biol. 15(1): 17 (2020)
2010 – 2019
- 2019
- [j15]Hyrum D. Carroll
, John L. Spouge, Mileidy Gonzalez:
MultiDomainBenchmark: a multi-domain query and subject database suite. BMC Bioinform. 20(1): 77:1-77:9 (2019) - 2016
- [j14]Sergey Sheetlin, Yonil Park, Martin C. Frith
, John L. Spouge:
ALP & FALP: C++ libraries for pairwise local alignment E-values. Bioinform. 32(2): 304-305 (2016) - [j13]Natalia Acevedo-Luna, Leonardo Mariño-Ramírez
, Armand Halbert, Ulla Hansen
, David Landsman, John L. Spouge:
Most of the tight positional conservation of transcription factor binding sites near the transcription start site reflects their co-localization within regulatory modules. BMC Bioinform. 17: 479:1-479:12 (2016) - 2015
- [j12]Hyrum D. Carroll, Alex C. Williams, Anthony G. Davis, John L. Spouge:
Improving Retrieval Efficacy of Homology Searches Using the False Discovery Rate. IEEE ACM Trans. Comput. Biol. Bioinform. 12(3): 531-537 (2015) - 2014
- [j11]Sergey L. Sheetlin, Yonil Park, Martin C. Frith
, John L. Spouge:
Frameshift alignment: statistics and post-genomic applications. Bioinform. 30(24): 3575-3582 (2014) - [j10]John L. Spouge, Leonardo Mariño-Ramírez
, Sergey L. Sheetlin:
Searching for repeats, as an example of using the generalised Ruzzo-Tompa algorithm to find optimal subsequences with gaps. Int. J. Bioinform. Res. Appl. 10(4/5): 384-408 (2014) - 2013
- [c3]Hyrum D. Carroll, Alex C. Williams, Anthony G. Davis, John L. Spouge:
False Discovery Rate for Homology Searches. BSB 2013: 194-201 - 2012
- [j9]Susanta Tewari, John L. Spouge:
Software: an open-source and scalable framework for exact calculations in coalescent theory. BMC Bioinform. 13: 257 (2012) - [c2]John L. Spouge, Leonardo Mariño-Ramírez
, Sergey Sheetlin:
The ruzzo-tompa algorithm can find the maximal paths in weighted, directed graphs on a one-dimensional lattice. ICCABS 2012: 1-6 - [e1]Sorin Istrail, Ion I. Mandoiu, Mihai Pop, Sanguthevar Rajasekaran, John L. Spouge:
IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2012, Las Vegas, NV, USA, February 23-25, 2012. IEEE Computer Society 2012, ISBN 978-1-4673-1320-9 [contents] - 2010
- [j8]Hyrum D. Carroll, Maricel G. Kann, Sergey Sheetlin, John L. Spouge:
Threshold Average Precision (TAP-k): a measure of retrieval designed for bioinformatics. Bioinform. 26(14): 1708-1713 (2010)
2000 – 2009
- 2008
- [j7]Nak-Kyeong Kim, Kannan Tharakaraman
, Leonardo Mariño-Ramírez
, John L. Spouge:
Finding sequence motifs with Bayesian models incorporating positional information: an application to transcription factor binding sites. BMC Bioinform. 9 (2008) - 2006
- [j6]Nak-Kyeong Kim, Kannan Tharakaraman
, John L. Spouge:
Adding sequence context to a Markov background model improves the identification of regulatory elements. Bioinform. 22(23): 2870-2875 (2006) - [j5]Kannan Tharakaraman
, Leonardo Mariño-Ramírez
, Sergey Sheetlin, David Landsman
, John L. Spouge:
Scanning sequences after Gibbs sampling to find multiple occurrences of functional elements. BMC Bioinform. 7: 408 (2006) - 2005
- [c1]Kannan Tharakaraman
, Leonardo Mariño-Ramírez
, Sergey Sheetlin, David Landsman
, John L. Spouge:
Alignments anchored on genomic landmarks can aid in the identification of regulatory elements. ISMB (Supplement of Bioinformatics) 2005: 440-448 - 2004
- [j4]Yonil Park, John L. Spouge:
Searching for Multiple Words in a Markov Sequence. INFORMS J. Comput. 16(4): 341-347 (2004) - 2002
- [j3]Yonil Park, John L. Spouge:
The correlation error and finite-size correction in an ungapped sequence alignment. Bioinform. 18(9): 1236-1242 (2002) - [j2]Sanguthevar Rajasekaran, X. Jin, John L. Spouge:
The Efficient Computation of Position-Specific Match Scores with the Fast Fourier Transform. J. Comput. Biol. 9(1): 23-33 (2002)
1990 – 1999
- 1991
- [j1]John L. Spouge:
Fast optimal alignment. Comput. Appl. Biosci. 7(1): 1-7 (1991)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint