Cargando…
Mapping biological entities using the longest approximately common prefix method
BACKGROUND: The significant growth in the volume of electronic biomedical data in recent decades has pointed to the need for approximate string matching algorithms that can expedite tasks such as named entity recognition, duplicate detection, terminology integration, and spelling correction. The tas...
Autores principales: | Rudniy, Alex, Song, Min, Geller, James |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4086698/ https://www.ncbi.nlm.nih.gov/pubmed/24928653 http://dx.doi.org/10.1186/1471-2105-15-187 |
Ejemplares similares
-
Speeding up tandem mass spectrometry-based database searching by longest common prefix
por: Zhou, Chen, et al.
Publicado: (2010) -
Improving read mapping using additional prefix grams
por: Kim, Jongik, et al.
Publicado: (2014) -
A prefix and attention map discrimination fusion guided attention for biomedical named entity recognition
por: Guan, Zhengyi, et al.
Publicado: (2023) -
Using the longest significance run to estimate region-specific p-values in genetic association mapping studies
por: Lian, Ie-Bin, et al.
Publicado: (2008) -
Cytological Effects of Prefixation Treatment
por: Hungerford, David A., et al.
Publicado: (1958)