{"id":"https://openalex.org/W1978255406","doi":"https://doi.org/10.1007/s00453-007-9141-3","title":"Indexing Factors with Gaps","display_name":"Indexing Factors with Gaps","publication_year":2007,"publication_date":"2007-12-05","ids":{"openalex":"https://openalex.org/W1978255406","doi":"https://doi.org/10.1007/s00453-007-9141-3","mag":"1978255406"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9141-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9141-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Costas S. Iliopoulos","raw_affiliation_strings":["Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London, WC2R 2LS, England, UK","King\u2019s College London, Algorithm Design Group, Department of Computer Science, Strand, WC2R 2LS, London, England, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London, WC2R 2LS, England, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King\u2019s College London, Algorithm Design Group, Department of Computer Science, Strand, WC2R 2LS, London, England, UK#TAB#","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029174615","display_name":"M. Sohel Rahman","orcid":"https://orcid.org/0000-0001-9419-6478"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M. Sohel Rahman","raw_affiliation_strings":["Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London, WC2R 2LS, England, UK","King\u2019s College London, Algorithm Design Group, Department of Computer Science, Strand, WC2R 2LS, London, England, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London, WC2R 2LS, England, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King\u2019s College London, Algorithm Design Group, Department of Computer Science, Strand, WC2R 2LS, London, England, UK#TAB#","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058155947"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.4509,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.85090682,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"55","issue":"1","first_page":"60","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.791935920715332},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.588559627532959},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5424190163612366},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.5337131023406982},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4909370243549347},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.47853073477745056},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4361536502838135},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.422060489654541},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.42159438133239746},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41790515184402466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4091954231262207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36093437671661377},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34631651639938354},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.1145637035369873}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.791935920715332},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.588559627532959},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5424190163612366},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.5337131023406982},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4909370243549347},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47853073477745056},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4361536502838135},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.422060489654541},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.42159438133239746},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41790515184402466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4091954231262207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36093437671661377},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34631651639938354},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.1145637035369873},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-007-9141-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9141-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.63.820","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.820","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.kcl.ac.uk/staff/csi/publications/IR06IndFacGaps.pdf","raw_type":"text"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/9b3bc581-6b06-4ccd-b97f-d8e3bd22e1d8","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/9b3bc581-6b06-4ccd-b97f-d8e3bd22e1d8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Iliopoulos, C S & Rahman, M S 2009, 'Indexing Factors with Gaps', ALGORITHMICA, vol. 55, no. 1, pp. 60 - 70. https://doi.org/10.1007/s00453-007-9141-3","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W642038236","https://openalex.org/W938539187","https://openalex.org/W1482360569","https://openalex.org/W1485516007","https://openalex.org/W1489358333","https://openalex.org/W1494423087","https://openalex.org/W1496038746","https://openalex.org/W1516545470","https://openalex.org/W1582857978","https://openalex.org/W1714821586","https://openalex.org/W1887000090","https://openalex.org/W1955121107","https://openalex.org/W1990061958","https://openalex.org/W2051158076","https://openalex.org/W2059513841","https://openalex.org/W2064184672","https://openalex.org/W2065562996","https://openalex.org/W2085218027","https://openalex.org/W2089052894","https://openalex.org/W2107079154","https://openalex.org/W2107248520","https://openalex.org/W2118703123","https://openalex.org/W2121252285","https://openalex.org/W2128591967","https://openalex.org/W2130564474","https://openalex.org/W2132926880","https://openalex.org/W2136741147","https://openalex.org/W2146812437","https://openalex.org/W2154125479","https://openalex.org/W2155237411","https://openalex.org/W2158874082","https://openalex.org/W2161936973","https://openalex.org/W2165513755"],"related_works":["https://openalex.org/W1583922594","https://openalex.org/W2998448420","https://openalex.org/W1974038726","https://openalex.org/W1953626159","https://openalex.org/W4304731099","https://openalex.org/W4280502676","https://openalex.org/W3095240633","https://openalex.org/W75168880","https://openalex.org/W1976803949","https://openalex.org/W4230281099"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}