{"doi":"10.1007/978-3-319-02432-5_27","title":"Suffix Array of Alignment: A Practical Index for Similar Data","abstract":null,"journal":"Lecture Notes in Computer Science","year":2013,"id":608179,"datarank":0.44166584687496613,"base_score":2.9444389791664403,"endowment":2.9444389791664403,"self_citation_contribution":0.44166584687496613,"citation_network_contribution":0.0,"self_endowment_contribution":0.44166584687496613,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":18,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1561872,"name":"Heejin Park","orcid":null,"position":1,"is_corresponding":false},{"id":1494871,"name":"Sunho Lee","orcid":"0000-0001-9534-3337","position":2,"is_corresponding":false},{"id":1561874,"name":"Minsung Hong","orcid":null,"position":3,"is_corresponding":false},{"id":1561876,"name":"Thierry Lecroq","orcid":null,"position":4,"is_corresponding":false},{"id":1561877,"name":"Laurent Mouchard","orcid":null,"position":5,"is_corresponding":false},{"id":1561878,"name":"Kunsoo Park","orcid":null,"position":6,"is_corresponding":false},{"id":1561869,"name":"Joong Chae Na","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Suffix Array of Alignment: A Practical Index for Similar Data","abstract":null,"is_dataset_classified":null,"base_score":2.9444389791664403,"endowment":2.9444389791664403,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21097893","pmcid":null,"openalex_id":"https://openalex.org/W1749587086","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2014,"count":2},{"year":2015,"count":2},{"year":2016,"count":1},{"year":2017,"count":4},{"year":2018,"count":4},{"year":2019,"count":1},{"year":2020,"count":2},{"year":2022,"count":2}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://link.springer.com/content/pdf/10.1007/978-3-319-02432-5_27","host_type":"publisher"},{"url":"https://doi.org/10.1007/978-3-319-02432-5_27","host_type":"book series"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.1938","host_type":""}],"fields_of_study":["Algorithms and Data Compression","Genomics and Phylogenetic Studies","Network Packet Processing and Optimization"],"mesh_terms":[],"keywords":["Generalized suffix tree","Suffix","Suffix tree","Compressed suffix array","Suffix array","Lexicographical order","Computer science","String (physics)","Tree (set theory)","Data structure","Edit distance","Algorithm","Mathematics","Combinatorics","Programming language"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-30T07:38:03.969526Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}