The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
PowerCore: a program applying the advanced M strategy with a heuristic search for establishing core sets
Open accessAbstract
Motivation: Core sets are necessary to ensure that access to useful alleles or characteristics retained in genebanks is guaranteed. We have successfully developed a computational tool named ‘PowerCore’ that aims to support the development of core sets by reducing the redundancy of useful alleles and thus enhancing their richness. Results: The program, using a new approach completely different from any other previous methodologies, selects entries of core sets by the advanced M (maximization) strategy implemented through a modified heuristic algorithm. The developed core set has been validated to retain all characteristics for qualitative traits and all classes for quantitative ones. PowerCore effectively selected the accessions with higher diversity representing the entire coverage of variables and gave a 100% reproducible list of entries whenever repeated. Availability: PowerCore software uses the .NET Framework Version 1.1 environment which is freely available for the MS Windows platform. The files can be downloaded from http://genebank.rda.go.kr/powercore/. The distribution of the package includes executable programs, sample data and a user manual. Contact: yjpark@rda.go.kr
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Automated generation of heuristics for biological sequence comparison
Slater, G. S. C., & Birney, E. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-31 · Cited by 2,933
The Choice of a Class Interval
Sturges, H. A. (1926) · Journal of the American Statistical Association · doi:10.1080/01621459.1926.10502161 · Cited by 1,764
GeneMark: web software for gene finding in prokaryotes, eukaryotes and viruses
Besemer, J., & Borodovsky, M. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki487 · Cited by 1,163
Core collections: a practical approach to genetic resources management
Brown, A. H. D. (1989) · Genome · doi:10.1139/g89-144 · Cited by 839
A Heuristic Approach to Solving Travelling Salesman Problems
Karg, R. L., & Thompson, G. L. (1964) · Management Science · doi:10.1287/mnsc.10.2.225 · Cited by 210
Nested core collections maximizing genetic diversity in Arabidopsis thaliana
McKhann, H. I., Camilleri, C., Bérard, A., Bataillon, T., David, J. L., Reboud, X., Le Corre, V., Caloustian, C., Gut, I. G., & Brunel, D. (2004) · The Plant Journal · doi:10.1111/j.1365-313x.2004.02034.x · Cited by 187
Sampling Strategies for Conserving Maize Diversity When Forming Core Subsets Using Genetic Markers
Franco, J., Crossa, J., Warburton, M. L., et al. (2006) · Crop Science · doi:10.2135/cropsci2005.07-0201 · Cited by 105
Genomic multiple sequence alignments: refinement using a genetic algorithm
Wang, C., & Lefkowitz, E. J. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-200 · Cited by 26
Metadata
- Authors
- Kim, K.-W., Chung, H.-K., Cho, G.-T., Ma, K.-H., Chandrabalan, D., Gwag, J.-G., Kim, T.-S., Cho, E.-G., & Park, Y.-J.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2007-06-22
- Volume
- 23
- Issue
- 16
- Pages
- 2155-2162
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2126273317
- Cited by
- 310
- References
- 10
- FWCI
- 1.84
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.